Submission #1301467

---

Source Code Expand

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
long long y(int k) {
	if (k == 0)return 1;
	else return 2 * y(k - 1);
}
int main() {
	queue<long long>l;
	int n; cin >> n;
	for (long long i = 0; i < y(n); i++){
		long long p;
		cin >> p;
		l.push(p);
	}
	while (l.size() != 1) {
		long long a = l.front();
		l.pop();
		long long b = l.front();
		l.pop();
		if (a > b)l.push(a - b);
		else if (a == b)l.push(a);
		else if (a < b)l.push(b - a);
	}
	cout << l.front() << endl;
	char c; cin >> c;
}

Submission Info

Judge Result