1048. Find Coins (25)-PAT
来源:互联网 发布:带租约商铺 知乎 编辑:程序博客网 时间:2024/05/22 13:07
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
推荐指数:※
来源:http://pat.zju.edu.cn/contests/pat-a-practise/1048
思想与编程之美的”2.12快速寻找满足条件的两个数“相同
#include<iostream>#include<stdio.h>#include<stdlib.h>int compare_int(const void * a, const void *b){return (*((int*)a)-*((int *)b));}using namespace std;int main(){int low,high;int n,m,i;cin>>n>>m;int *coins=new int[n];for(i=0;i<n;i++)cin>>coins[i];qsort(coins,n,sizeof(int),compare_int);low=0;high=n-1;do{int tmp=coins[low]+coins[high];if(tmp==m){cout<<coins[low]<<" "<<coins[high]<<endl;break;}else if(tmp>m)high--;elselow++;}while(low<=high-1);if(low>high-1)cout<<"No Solution"<<endl;return 0;}
- 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 1048. Find Coins (25)
- PAT 1048.Find Coins
- 【PAT】1048. Find Coins
- PAT--1048. Find Coins
- PAT 1048. Find Coins
- PAT-Find Coins (25)
- PAT (Advanced) 1048. Find Coins (25)
- PAT甲 1048. Find Coins (25)
- PAT(A) - 1048. Find Coins (25)
- 【PAT甲级】1048. Find Coins (25)
- 1048. Find Coins (25) PAT 甲级
- PAT(甲级)1048. Find Coins (25)
- ProgressBar自定义漂亮样式样式
- 面对SEO越来越空泛的局面我们应该做何选择
- WebService服务的发布及多种客户端方式调用
- Android的Touch事件处理机制
- Scrum Master要做些啥?
- 1048. Find Coins (25)-PAT
- HDOJ 1019 Least Common Multiple
- java Web应用架构
- junit常见断言
- Struts2中的标签介绍 s:property s:set s:bean s:push s:date
- 电池容量足够低如何触发自动关机(Riogrande platform&Qualcom platform)
- 面对百度新型算法站长该如何应对
- myeclipse 8.5最新注册码(过期时间到2016年)
- hdu 1051 Wooden Sticks