-
输入
-
There are multiple test cases.
Each test case contains three lines.The first line is an integer N(1≤N≤20),represents the array contains N integers. The second line contains N integers,the ith integer represents A[i](-10^8≤A[i]≤10^8).The third line contains an integer K(-10^8≤K≤10^8).
输出
- If Tom can choose some integers from the array and their them is K,printf ”Of course,I can!”; other printf ”Sorry,I can’t!”. 样例输入
-
4 1 2 4 7 13 4 1 2 4 7 15
样例输出
-
Of course,I can!
Sorry,I can't!
-
#include<stdio.h> #include<string.h> int a[25],n,t; int vis[25]; int flag=0; int sum=0; void dfs(int cur) { // printf("sum==%d cur=%d\n",sum,cur); if(sum==t) { flag=1; return ; } if(flag) { return ; } if(cur>=n) { return ; } if(sum<0) { return ; } if(sum>t) { return ; }//各种剪枝,不然会超时 for(int i=cur;i<n;i++) { if(!vis[i]) { vis[i]=1; sum+=a[i]; dfs(i); vis[i]=0; sum-=a[i]; // printf("a[%d]=%d sum=%d\n",i,a[i],sum); } } return ; } int main() { while(scanf("%d",&n)!=EOF) { memset(vis,0,sizeof(vis)); memset(a,0,sizeof(a)); flag=0; for(int i=0;i<n;i++) { scanf("%d",&a[i]); } scanf("%d",&t); dfs(0);//从0开始 if(flag) { printf("Of course,I can!\n"); } else { printf("Sorry,I can't!\n"); } } }
nyoj 927The partial sum problem (DFS)
最新推荐文章于 2020-11-03 23:19:01 发布