Submission #1986266

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

using ll = long long;
using P = pair<int, int>;

const int INF = 1e9;
const int MOD = 1e9 + 7;

// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int main() {
  // 入力
  int N;
  cin >> N;
  int n = pow(2, N);
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];

  for (int i = 1; i < n; i *= 2) {
    for (int j = 0; j < n - 1; j += i) {
      if (a[j] > a[j+i]) {
        a[j] = a[j] - a[j+i];
      } else if (a[j] < a[j+i]) {
        a[j] = a[j+i] - a[j];
      }
    }
  }

  // 解答
  cout << a[0] << endl;

  return 0;
}

Submission Info

Judge Result