1048. Find Coins (25)
2016-02-20 17:06
417 查看
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
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<algorithm> using namespace std; int coin[1000]={0}; int a[100005]; int main(){ int n,m; cin>>n>>m; for(int i=0;i<n;i++){ cin>>a[i]; coin[a[i]]++; } sort(a,a+n); for(int i=0;i<n;i++){ coin[a[i]]--; if(coin[m-a[i]]>0){ cout<<a[i]<<" "<<m-a[i]<<endl; return 0; } } cout<<"No Solution"; return 0; }
相关文章推荐
- python-opencv图像基本读取函数
- android下拉刷新上拉加载的XListView的完美修改版,增加仿IOS的等待圈
- 【Unity3d】3d角色换装实现原理及步骤
- Event Listener's Adapter Classes
- HDU 1495 非常可乐
- POJ 1185 炮兵阵地 (状压dp)
- Android属性动画完全解析(下),Interpolator和ViewPropertyAnimator的用法
- 如何收缩超大的SharePoint_Config数据库
- java语言学习笔记1
- EasyUI系列学习(九)-Panel(面板)
- 同时向主表和从表里面导入execl数据 (asp.net webform)
- How many ways(记忆化搜索)
- SQL语句得到较为精确的用户年龄
- ubuntu 安装trac
- SharePoint 2013 WebPart 管理工具分享[开源]
- [转]Highcharts仪表盘制作
- Android漫游记(4)---.so文件动态调试一例
- 手机网页布局经验总结
- less初学1:是什么?怎么用?
- 1、JavaScript入门篇