AcWing 4498. 指针(java---暴力dfs)
原题链接
中等
作者:
CYHMMZDAN
,
2023-03-21 20:50:27
,
所有人可见
,
阅读 140
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static long[] a=new long[1000005];
static long[] b=new long[1000005];
static int[] c=new int[200005];
static int[] d=new int[200005];
static int[] e=new int[200005];
static int[] f=new int[200005];
static int t=520;
static int ans=0;
static int max=-1;
static int min=(int)2e+9;
static int n=0;
static int m=0;
static HashMap<Integer,Integer> map=new HashMap<>();
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
for(int i=1;i<=n;i++) {
d[i]=sc.nextInt();
}
dfs(0,0);
System.out.println("NO");
}
public static void dfs(int t,int z) {
if ((t==0||t==360)&&z==n) {
System.out.println("YES");
System.exit(0);
}
if(z>n) {
return;
}
dfs((t+d[z+1]+360)%360,z+1);
dfs((t-d[z+1]+360)%360,z+1);
}
}