PAT--1048. Find Coins
来源:互联网 发布:冯大辉离职 知乎 编辑:程序博客网 时间:2024/05/09 08:37
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
题解
寻找数组中两数之和等于m的两个数。
#include <bits/stdc++.h>using namespace std;const int maxn = 100010;int n, m;int a[maxn];void sol(){ int i = 0, j = n - 1; int sum = 0; while(i <= j){ if(i != j && a[i] + a[j] == m){ printf("%d %d", a[i], a[j]); return; }else if(a[i] + a[j] < m) ++i; else --j; } if(i > j) printf("No Solution\n");}void sol2(){ int v1, v2, flag = 0; for(int i = 0; i < n; ++i){ v1 = a[i], v2 = m - v1; if(binary_search(a + i + 1, a + n, v2)){ flag = 1; break; } } if(!flag){ printf("No Solution\n"); }else{ printf("%d %d\n", v1, v2); }}int main(){#ifndef ONLINE_JUDGEfreopen("data.in", "r", stdin);#endif // ONLINE_JUDGE scanf("%d %d", &n, &m); for(int i = 0; i < n; ++i) scanf("%d", a + i); sort(a, a + n); sol(); //sol2(); return 0;}
- PAT 1048.Find Coins
- 【PAT】1048. Find Coins
- PAT--1048. Find Coins
- PAT 1048. Find Coins
- 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-A 1048. Find Coins
- pat 1048. Find Coins (25)
- 浙大PAT 1048题 1048. Find Coins
- 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 甲级
- 关于Const跟volatile
- 使用Eclipse运行Servlet出现500错误 提示Error instantiating servlet class
- mac laravel安装属组属主问题
- 七牛云 Java Web上传图片
- SQL语句拼接常加 where 1=1 的原因
- PAT--1048. Find Coins
- svg入门:使用js去操作svg图像
- 洛谷P2089 烤鸡
- 草根程序员转型做项目管理走过的点点滴滴_读书方法总结
- 代替结构体中定义指针奇淫技巧
- c++进阶学习计划
- Android五大组件-ContentProvider
- git oschina使用步骤总结
- Phthon出现SyntaxError: Non-ASCII character '\xe8' in file