【PAT】【Advanced Level】1048. Find Coins (25)
来源:互联网 发布:java八种基本类型 编辑:程序博客网 时间:2024/06/04 19:49
1048. Find Coins (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 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 151 2 8 7 2 4 11 15Sample Output 1:
4 11Sample Input 2:
7 141 8 7 2 4 11 15Sample Output 2:
No Solution
https://www.patest.cn/contests/pat-a-practise/1048
思路:
开数组存储相应金额硬币的个数
从小到大搜索,找到合适的一对为止
CODE:
#include<iostream>#include<cstdio>#include<cstring>#define N 1001using namespace std;int co[N];int main(){for (int i=0;i<N;i++) co[i]=0;int n,m;scanf("%d%d",&n,&m);for (int i=0;i<n;i++){int t;scanf("%d",&t);co[t]++;}int fl=0;for (int i=1;i+i<=m;i++){if (co[i]==0) continue;co[i]--;if(co[m-i]!=0){fl=1;cout<<i<<" "<<m-i;break;}}if (fl==0) cout<<"No Solution";return 0;}
- 【PAT】【Advanced Level】1048. Find Coins (25)
- 【C++】PAT(advanced level)1048. Find Coins (25)
- PAT (Advanced Level) Practise 1048 Find Coins (25)
- PAT (Advanced Level) Practise 1048 Find Coins (25)
- Pat(Advanced Level)Practice--1048(Find Coins)
- PAT (Advanced) 1048. Find Coins (25)
- PAT (Advanced Level) 1048. Find Coins (25) 数组中两数的和
- 1048. Find Coins (25)【排序】——PAT (Advanced Level) Practise
- 【PAT Advanced Level】1068. Find More Coins (30)
- Pat(Advanced Level)Practice--1068(Find More Coins)
- PAT (Advanced Level) Practise 1068 Find More Coins (30)
- PAT (Advanced Level) Practise 1068 Find More Coins (30)
- 【PAT】【Advanced Level】1068. Find More Coins (30)
- 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)
- cmd 运行php 文件
- Connect them ZOJ
- HDU6072(Kosaraju求强联通分量+位运算)
- ZigZag Conversion
- 邻接表 有向图 是否有环 C实现 (dfs
- 【PAT】【Advanced Level】1048. Find Coins (25)
- Android ContentProvider之ContentObserver内容观察者
- Linux基础
- 堆栈的简单介绍
- Linux ping命令 【转】
- Java中文件的压缩处理
- C#之入门总结_集合_10
- 第五弹——apache配置fastcgi&C/C++
- Redis 事务