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 could only use exactly two coins to pay the exact amount. Since she has as many as 105 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 two 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 (≤105, the total number of coins) and M (≤103, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the two face values V1 and V2 (separated by a space) such that V1+V2=M and V1≤V2. If such a solution is not unique, output the one with the smallest V1. If there is no solution, output No Solution
instead.
Sample Input 1:
8 15
1 2 8 7 2 4 11 15
Sample Output 1:
4 11
Sample Input 2:
7 14
1 8 7 2 4 11 15
Sample Output 2:
No Solution
代码:
#include<iostream>
using namespace std;
int main()
{
int N,M,coin[510]={0},temp;//coin[i]用来存放面值为i的硬币的数量
scanf("%d%d",&N,&M);//N,M,分别存储硬币的数量和需支付的金额,
for(int i=0;i<N;i++)//统计各个面值的硬币各有多少枚
{
scanf("%d",&temp);
coin[temp]++;
}
for(int i=1;i<=500;i++)//求解解决方案
{
if(coin[i]>0)//判断是否有面值为i的硬币
{
coin[i]--;//减减的目的是防止需要两枚相同面值的硬币,而cion[i]的值为1而导致的错误
temp=M-i;
if(i<=temp&&coin[temp]>0&&temp>0&&temp<=500)//由于硬币面值为1~500,因此需要保证硬币面值大于0,小于等于500
{
printf("%d %d",i,temp);//if语句已经保证i<=temp
return 0;
}
}
}
printf("No Solution");//无解决方案
return 0;
}