nyoj927The partial sum problem(DFS)

本文主要是介绍nyoj927The partial sum problem(DFS)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

描述

One day,Tom’s girlfriend give him an array A which contains N integers and asked him:Can you choose some integers from the N integers and the sum of them is equal to K. 

输入

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>
#include<algorithm>
using namespace std;
int a[25];
int n,k;
bool dfs(int i,int sum)
{if(i==n) return sum==k;if(dfs(i+1,sum)) return true;if(dfs(i+1,sum+a[i])) return true;return false;
}
int main()
{while(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++){scanf("%d",&a[i]);}scanf("%d",&k);if(dfs(0,0)) printf("Of course,I can!\n");else printf("Sorry,I can't!\n");}return 0;
}

这篇关于nyoj927The partial sum problem(DFS)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---