PAT 甲级 1048. Find Coins (25)
来源:互联网 发布:apache bin httpd.exe 编辑:程序博客网 时间:2024/06/06 09:27
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 105coins 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
#include <iostream>#include <vector>#include <algorithm>#include <cstring>using namespace std;int a[1001];int main() {int n, m, temp;scanf("%d %d", &n, &m);for (int i = 0; i < n; i++) {scanf("%d", &temp);a[temp]++;}for (int i = 1; i < 1001; i++) {if (a[i]) {a[i]--;if (m > i&&a[m - i]) {printf("%d %d\n", i, m - i);return 0;}a[i]++;}}printf("No Solution");return 0;}
- 【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)
- 1048. Find Coins (25)-PAT甲级
- PAT 甲级 1048. Find Coins (25)
- PAT甲级 1048. Find Coins (25)
- 1048. Find Coins (25)-PAT甲级真题
- 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)
- 1048. Find Coins (25)-PAT甲级真题(Hash散列)
- PAT甲级1068. Find More Coins (30)
- 将 Apache Shiro 改造成 JWT 认证方式
- python实现自动输出文字小demo(cmd下)
- 2122 数据结构实验之链表七:单链表中重复元素的删除
- java中的AES 256算法遇到 Illegal key size or default parameters错的解决办法
- !可以防止鼠标单击移动 标签 特别是动态生产的元素标签
- PAT 甲级 1048. Find Coins (25)
- 51Nod 1183 编辑距离 (DP
- Mac下配置sublime实现LaTeX
- 使用Struts,前台提交给后台的汉字为乱码
- 我的"游戏"职业生涯02
- 单例模式
- React Native 集成分享第三方登录功能分享第三方登录模块开发(iOS)
- 树查找
- 网页加载过慢的问题诊断思路