PAT 1048. Find Coins (25)
2018-03-19 16:17
459 查看
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:
Sample Output 1:
Sample Input 2:
Sample Output 2:
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> #include <cstdio> #include <vector> #include <map> #include <cstdio> using namespace std; int main() { int n,k; cin>>n>>k; int v[100005] = {0}; for(int i = 0; i < n; i++) { int temp; scanf("%d",&temp); v[temp]++; } for(int i = 1; i < k; i++) { if(v[i] > 0) { v[i]--; if(v[k-i]>0) { cout<<i<<" "<<k-i<<endl; return 0; } } } cout<<"No Solution"<<endl; return 0; }
相关文章推荐
- PAT (Advanced) 1048. Find Coins (25)
- PAT (Advanced) 1048. Find Coins (25)
- 1048. Find Coins (25)-PAT甲级真题
- PAT 甲级 1048. Find Coins (25)
- PAT 1048. Find Coins (25) 常见哈希应用,空间换时间
- 【PAT】1048. Find Coins (25)
- PAT甲级 1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- PAT (Advanced Level) 1048. Find Coins (25)
- 1048. Find Coins (25) PAT 甲级
- PAT_A 1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- 1048. Find Coins (25)-PAT
- 【PAT甲级】1048. Find Coins (25)
- PAT甲题题解-1048. Find Coins (25)-水
- PAT(甲级)1048. Find Coins (25)
- PAT 解题报告 1048. Find Coins (25)
- PAT (Advanced Level) 1048. Find Coins (25) 数组中两数的和
- PAT-A-1048. Find Coins (25)
- PAT 1048. Find Coins (25)(俩端找和,i++,j--很巧秒)