Problem C: Divisibility
Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17, 5, -21, 15. There are eight possible expressions:
17 | + | 5 | + | -21 | + | 15 | = | 16 |
17 | + | 5 | + | -21 | - | 15 | = | -14 |
17 | + | 5 | - | -21 | + | 15 | = | 58 |
17 | + | 5 | - | -21 | - | 15 | = | 28 |
17 | - | 5 | + | -21 | + | 15 | = | 6 |
17 | - | 5 | + | -21 | - | 15 | = | -24 |
17 | - | 5 | - | -21 | + | 15 | = | 48 |
17 | - | 5 | - | -21 | - | 15 | = | 18 |
You are to write a program that will determine divisibility of sequence of integers.
Input
The first line of the input file contains a integer M indicating the number of cases to be analyzed. Then M couples of lines follow.For each one of this couples, the first line contains two integers, N and K (1 <= N <= 10000, 2 <= K <= 100) separated by a space. The second line contains a sequence of N integers separated by spaces. Each integer is not greater than 10000 by it's absolute value.
Output
For each case in the input file, write to the output file the word "Divisible" if given sequence of integers is divisible by K or "Not divisible" if it's not.Sample input
2 4 7 17 5 -21 15 4 5 17 5 -21 15
Sample Output
DivisibleNot divisible
解决方案:我直接用dfs搜,通过对每层的每个结果进行标志,可以有效地剪枝,而且由于它最多有10000个层,而且结果有20000种,所以还要压缩。对每个结果求绝对值取余,可把结果压缩到100以内。ps:这题也可用dp来做。
代码:#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #define MMAX 10003 using namespace std; int num[MMAX]; bool vis[MMAX][103]; int N,K,f; void dfs(int cur,int sum){ if(sum%K==0&&(cur)>=N) {f=1;return ;} if(f==1||cur>=N||abs(sum)>10000) return ; for(int i=0;i<2;i++){ int s=sum; if(i==0) s+=num[cur]; else if(i==1) s-=num[cur]; int t=abs(s); t%=K; if(!f&&t<=10000&&!vis[cur][t]){ vis[cur][t]=true; dfs(cur+1,t); } if(f==1) return ; } } int main(){ int t; scanf("%d",&t); while(t--){ scanf("%d%d",&N,&K); for(int i=0;i<N;i++){ scanf("%d",&num[i]); } memset(vis,false,sizeof(vis)); f=0; dfs(1,num[0]); if(f){ printf("Divisible\n"); } else printf("Not divisible\n"); } return 0;}