The partial sum problem

原创 2016年08月29日 16:09:46


The partial sum problem

时间限制:1000 ms  |  内存限制:65535 KB
难度:2
描述
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");
     }
 }

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

DFS-The partial sum problem

The partial sum problem 时间限制:1000 ms  |  内存限制:65535 KB 难度:2 描述One day,Tom’s girlfriend ...
  • ACM_TH
  • ACM_TH
  • 2016年04月02日 13:00
  • 207

nyoj 927The partial sum problem (DFS)

One day,Tom’s girlfriend give him an array A which contains N integers and asked him:Can you choose ...

NYOJ-927 The partial sum problem

The partial sum problem 时间限制:1000 ms  |  内存限制:65535 KB 难度:2 描述One day,Tom’s girlfriend ...

The partial sum problem

The partial sum problem 时间限制:1000 ms  |  内存限制:65535 KB 难度:2 描述One day,Tom’s girlfriend ...

XTU 1264 Partial Sum【思维+贪心】

Partial Sum Accepted : 75   Submit : 326 Time Limit : 3000 MS   Memory Limit : 65536...

XTOJ1264 Partial Sum 【前缀和】

Partial SumAccepted : 98 Submit : 391 Time Limit : 3000 MS Memory Limit : 65536 KBParti...

STL-------------partial_sum

如果要想真正学好STL 提供网站 http://www.cplusplus.com/reference/algorithm/count/       template OutputI...

partial_sum

// partial_sum.cpp -- 2011-10-05-17.55 #include "stdafx.h" #include #include #include #inclu...

2017ccpc全国邀请赛(湖南湘潭) E. Partial Sum(前缀和)

Partial SumBobo has a integer sequence a1,a2,…,an of length n. Each time, he selects two ends 0≤l<r≤...

部分和(partial sum)在算法求解中的作用

1. 部分和的引入 并非什么高级深奥的技巧,但却十分有用。 假设按照降序排列 NN 个学生的考试成绩并保存到数组 scores[],现在想要编写求出从第 a 名到第 b 名成绩的函数 averag...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:The partial sum problem
举报原因:
原因补充:

(最多只允许输入30个字)