1068. Find More Coins (30)搜索题

最新推荐文章于 2020-03-24 01:49:38 发布

Uncle_Sugar

最新推荐文章于 2020-03-24 01:49:38 发布

阅读量580

点赞数 1

分类专栏： PAT甲级文章标签： dfs 搜索基础枚举

本文链接：https://blog.csdn.net/sinat_29278271/article/details/48022061

版权

PAT甲级专栏收录该内容

37 篇文章 1 订阅

订阅专栏

1068. Find More Coins (30)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 10⁴ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=10⁴, the total number of coins) and M(<=10², the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the face values V₁ <= V₂ <= ... <= V_k such that V₁ + V₂ + ... + V_k = M. All the numbers must be separated by a space, and there must be no extra space at the end of the line. If such a solution is not unique, output the smallest sequence. If there is no solution, output "No Solution" instead.

Note: sequence {A[1], A[2], ...} is said to be "smaller" than sequence {B[1], B[2], ...} if there exists k >= 1 such that A[i]=B[i] for all i < k, and A[k] < B[k].

Sample Input 1:

8 9
5 9 8 7 2 3 4 1

Sample Output 1:

1 3 5

Sample Input 2:

4 8
7 2 4 3

Sample Output 2:

No Solution

这道题目算是上面那道 1048. Find Coins (25)的进化版吧,PAT就是这样，历次考试的题目似乎会有一点承接关系。给你一组数a[n]、，和一个数m希望你找出字典序最少的一组数，使得该组数的和为m，其实就是深搜吧，本来如果数据量n小于63的话，是可以用位运算枚举，加上lowbit这样的小技巧，我估计会快的飞起来，然后数据量是10^4,那就只好老老实实深搜了。

# include <cstdio>
# include <algorithm>
using namespace std;


int n,m;
int Num[10005];
int ans[10005],E=0;

void dfs(int i,int sum,int End)
{//printf("i = %d sum = %d End = %d ",i,sum,End);
    static int flag = 1;
	if (flag==0)  return;
	if (sum==m)   flag = 0,E = End;/*This line of code should before line 16*/
    if (sum>=m)   return;
    if (i>=n)    return;
    
	ans[End++] = Num[i];
	dfs(i+1,sum+Num[i],End);
    
	End--;
	dfs(i+1,sum,End);
}
int main()
{
  int i,sum = 0;
  scanf("%d%d",&n,&m);  
  for (i=0;i<n;i++)
      {
	  scanf("%d",Num+i);
	  if (Num[i]>m)
          i--,n--;
	  else 
	      sum += Num[i];
	  }
  sort(Num,Num+n);
  //if (sum>=m)
       dfs(0,0,0);
  if (E==0)
    printf("No Solution\n");
  else
    for (i=0;i<E;i++)
        printf("%d%c",ans[i],i==E-1?'\n':' ');
  return 0    ;
}