https://pintia.cn/problem-sets/994805342720868352/problems/994805432256675840
1048 Find Coins (25)(25 分)
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 10^5^ 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 (<=10^5^, the total number of coins) and M(<=10^3^, 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 V~1~ and V~2~ (separated by a space) such that V~1~ + V~2~ = M and V~1~ <= V~2~. If such a solution is not unique, output the one with the smallest V~1~. 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
思路及关键点:
以下代码主要在于如何判断i===sum-i的情况,这时还需要判断hashtable[i]是否>=2?
但是,不知道为什么只得了20分;有两个测试点没过:
//判断给定序列中是否存在两个数的和为sum?
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int nmax=1010;
int hashtable[nmax];
int main(int argc, char** argv) {
int n,sum;
while(cin>>n>>sum){
int num;
for(int i=0;i<n;i++){
cin>>num;
hashtable[num]++;
}
//判断哈希表中是否存在i和sum-i?
for(int i=0;i<1010;i++){
if(hashtable[i]==1&&hashtable[sum-i]==1){
if(i==(sum-i)){
if(hashtable[i]>=2){
printf("%d %d\n",i,sum-i);
return 0;
}
else{
continue;
}
}
else{
printf("%d %d\n",i,sum-i);
return 0;
}
}
}
printf("No Solution\n");
}
return 0;
}
看了柳博主的方法尝试了以下,竟然也只得了20分,她本人的源代码可是25分
本人尝试:
//判断给定序列中是否存在两个数的和为sum?
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int nmax=1001;
int hashtable[nmax];
int main(int argc, char** argv) {
int n,sum;
while(cin>>n>>sum){
int num;
for(int i=0;i<n;i++){
cin>>num;
hashtable[num]++;
}
//判断哈希表中是否存在i和sum-i?
for(int i=0;i<1001;i++){
if(hashtable[i]==1){
hashtable[i]--;
if(i<sum&&hashtable[sum-i]==1){
printf("%d %d",i,sum-i);
return 0;
}
hashtable[i]++;
}
}
printf("No Solution");
}
return 0;
}
liuchuo巨巨的代码:
#include <iostream>
using namespace std;
int a[1001];
int main() {
int n, m, temp;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++) {
scanf("%d", &temp);
a[temp]++;
}
for(int i = 0; i < 1001; i++) {
if(a[i]) {
a[i]--;
if(m > i && a[m-i]) {
printf("%d %d", i, m - i);
return 0;
}
a[i]++;
}
}
printf("No Solution");
return 0;
}