Submission #1125716

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
  int n;
  cin >> n;
  queue<int> que;
  REP(i, 1<<n) {
    int a;
    cin >> a;
    que.push(a);
  }

  while(que.size() != 1) {
    int s = que.front(); que.pop();
    int t = que.front(); que.pop();
    if(s > t) que.push(s-t);
    else if(s == t) que.push(s);
    else if(s < t) que.push(t-s);
    else assert(false);
  }

  cout << que.front() << endl;

  return 0;
}

Submission Info

Judge Result