# The partial sum problem

﻿﻿

## 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!
深度优先搜索：它的思想是从一个顶点V0开始，沿着一条路一直走到底，如果发现不能到达目标解，那就返回到上一个节点，然后从另一条路开始走到底，这种尽量往深处走的概念即是深度优先的概念。
 #include<stdio.h>
int a[1000];
int sum=0;
int k,n;
bool p;
void f(int l)
{
if(sum==k)
p=true;
if(sum>k)
{
return;
}
for(int i=l;i<n;i++)
{
sum+=a[i];
f(i+1);
sum-=a[i];
}
}
int main()
{
while(scanf("%d",&n)!=-1)
{p=false;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
f(0);
if(p)
printf("Of course,I can!\n");
else
printf("Sorry,I can't!\n");
}
}


#### Partial Sum（湘潭邀请赛E题（部分和问题））

2017-05-15 15:46:37

#### 部分和（partial sum）在算法求解中的作用

2016-09-09 17:31:10

#### The partial sum problem（dfs）

2017-05-01 21:24:54

#### The partial sum problem 搜索

2017-11-10 21:55:43

#### NYOJ The partial sum problem

2014-12-24 20:12:16

#### DFS-The partial sum problem

2016-04-02 13:00:50

#### NOOJ927The partial sum problem

2016-04-14 21:07:40

#### NYOJ927The partial sum problem

2014-04-01 18:03:00

#### NYOJ-927 The partial sum problem

2014-07-22 14:47:32

#### NYOJ-927-The partial sum problem

2017-04-14 10:09:27