NSOJ Thepartialsumproblem

最新推荐文章于 2018-07-23 20:46:56 发布

AYZXX

最新推荐文章于 2018-07-23 20:46:56 发布

阅读量276

点赞数

分类专栏：深搜

本文链接：https://blog.csdn.net/AYZXX/article/details/72444624

版权

深搜专栏收录该内容

24 篇文章 0 订阅

订阅专栏

Thepartialsumproblem

时间限制: 1000ms

内存限制: 128000KB

64位整型: Java 类名:

上一题

提交运行结果统计讨论版

下一题

题目描述

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!”.

样例输入

样例输出

Of course,I can!
Sorry,I can't!

来源

NYOJ

题解：简单的深搜，如果只是每次循环结果sum判断，会超时，应该和总和的差值sum1-sum一起判断，这样才不会超时。

#include<stdio.h>
#include<string.h>
int a[21],book[21],n,m,flag,sum1;
void dfs(int sum )
{
	if(sum==m||sum1-sum==m)     
	  flag=1;
    if(sum>n)
	  return ;
	if(flag)
   	 return ;
	for(int i=0;i<n;i++)
		if(!book[i])
		{
			book[i]=1;
			dfs(sum+a[i]);
			book[i]=0;
		}
		return ;
}
int main()
{
	while(~scanf("%d",&n))
	{
	  sum1=0;
	  for(int i=0;i<n;i++)
	  {
	    scanf("%d",&a[i]);
	    sum1+=a[i];
	  }
	  scanf("%d",&m); 
	  memset(book,0,sizeof(book));
	  flag=0;   dfs(0);
	  if(flag)
	  printf("Of course,I can!\n");
	  else printf("Sorry,I can't!\n");
	} 
	return 0;
}