The partial sum problem

描述

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>
using namespace std;
int arr[25];
int flag;
int n,m;
int Dfs(int step,int sum){
    if(step==n) return sum==m;
    if(Dfs(step+1,sum)) return 1; //加第step个数字 
    if(Dfs(step+1,sum+arr[step])) return 1;//不加第step个数字 
    return 0;
}
int main(){
	while(scanf("%d",&n)!=EOF){
		int i;
		for(i=0;i<n;i++)
		scanf("%d",&arr[i]);
		scanf("%d",&m);
		flag=Dfs(0,0);
		if(!flag) printf("Sorry,I can't!\n");
		else printf("Of course,I can!\n");
	}
	return 0;
}