B.Petr and a Combination Lock

 https://codeforces.com/contest/1097/problem/A

Petr and a Combination Lock

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Petr has just bought a new car. He's just arrived at the most known Petersburg's petrol station to refuel it when he suddenly discovered that the petrol tank is secured with a combination lock! The lock has a scale of 360360 degrees and a pointer which initially points at zero:

 

 

Petr called his car dealer, who instructed him to rotate the lock's wheel exactly nn times. The ii-th rotation should be aiai degrees, either clockwise or counterclockwise, and after all nn rotations the pointer should again point at zero.

This confused Petr a little bit as he isn't sure which rotations should be done clockwise and which should be done counterclockwise. As there are many possible ways of rotating the lock, help him and find out whether there exists at least one, such that after all nn rotations the pointer will point at zero again.

 

 

Input

 

The first line contains one integer nn (1≤n≤151≤n≤15) — the number of rotations.

Each of the following nn lines contains one integer aiai (1≤ai≤1801≤ai≤180) — the angle of the ii-th rotation in degrees.

 

 

Output

 

If it is possible to do all the rotations so that the pointer will point at zero after all of them are performed, print a single word "YES". Otherwise, print "NO". Petr will probably buy a new car in this case.

You can print each letter in any case (upper or lower).

 

 

Examples

 

 

input

3
10
20
30

output

YES

input

3
10
10
10

output

NO

input

3
120
120
120

output

YES

 

 

Note

 

In the first example, we can achieve our goal by applying the first and the second rotation clockwise, and performing the third rotation counterclockwise.

In the second example, it's impossible to perform the rotations in order to make the pointer point at zero in the end.

In the third example, Petr can do all three rotations clockwise. In this case, the whole wheel will be rotated by 360360 degrees clockwise and the pointer will point at zero again.

1左移i位， 然后与c按位与。
&当两个操作数对应位都是1，结果才是1.
而1<<i 只有右数第i位是1， 其他都是0.
那么要结果非0， 除非c的第i位也是1.
所以 这个就是判断c的第i位是否为1， 如为1， 那么if成立。 否则if不成立。
PS:这里说的第i位都是从0计数的。

所以此处的意思从1开始遍历全部+1，-1的过程

递推

/*
 Author: LargeDumpling
 Email: LargeDumpling@qq.com
 Edit History:
    2019-01-04    File created.
*/

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN=15;
int n,a[MAXN],limit;
int main()
{
    bool flag=false;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    limit=1<<n;
    for(int S=0;S<limit;S++)
    {
        int sum=0;
        for(int i=0;i<n;i++)
            if((S>>i)&1) sum+=a[i];
            else sum-=a[i];
        if(sum%360==0)
            flag=true;
    }
    if(flag) puts("YES");
    else puts("NO");
    fclose(stdin);
    fclose(stdout);
    return 0;
}

 

递归 dfs

#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a[N];
char str;
void dfs(int c,int x){
    if(c>=n){
        if(x%360==0)
            ans=1;
        return;
    }
    if(ans)
        return;
    dfs(c+1,x+a[c+1]);
    dfs(c+1,x-a[c+1]);
}
int main()
{
#ifdef DEBUG
    freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    dfs(0,0);
    if(ans)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;

    return 0;
}