# The partial sum problem

46人阅读 评论(0)

﻿﻿

## 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>
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");
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：59669次
• 积分：4226
• 等级：
• 排名：第7526名
• 原创：370篇
• 转载：74篇
• 译文：0篇
• 评论：5条
博主信息

Name: wanghandou

Email:1477996837@qq.com

文章分类
最新评论