南阳理工---题目927The 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!

来源

原创

上传者

TC_李远航

分析：输入一个数n，输入n个数，再输入一个数k，如果这n个数中的若干个数相加为k，则输出of   course,I can!否则的话输出Sorry,I  can't,这是一道DFS的题

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int a[30],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(cin>>n)
    {
        if(n==0)
            break;
        for(int i=0;i<n;i++)
            cin>>a[i];
            cin>>k;
            if(dfs(0,0))
                printf("Of course,I can!\n");
            else
                printf("Sorry,I can't!\n");
    }
    return 0;
}