1097B - Petr and a Combination Lock

位运算：

用在$[0,2^n]$的每一个数来枚举所有情况，如果$i>>j\mathrm{\&}1==1$，那么就要往右转，否则要往左转。

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 20;
int n;
int a[N];
int main () {
	cin >> n;
	for (int i = 0;i < n;i++) cin >> a[i];
	bool flag = false;
	for (int k = 0;k < 1 << n;k++) {
		int degree = 0;
		for (int i = 0;i < n;i++) {
			if (k >> i & 1) degree += a[i];
			else degree -= a[i];
		}
		if (degree%360 == 0) {
			flag = true;
			break;
		}
	}
	if (flag) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}