1048. Find Coins (25)-PAT甲级真题(Hash散列)
来源:互联网 发布:会计网络教育 编辑:程序博客网 时间:2024/06/12 19:56
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 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
题目大意:给出n个正整数和一个正整数m,问n个数字中是否存在一对数字a和b(a <= b),使a+b=m成立。如果有多个,输出a最小的那一对。
分析:建立数组a保存每个数字出现的次数,然后判断输出
#include <cstdio>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 = 0; i < 1001; i++) { if(a[i]) { a[i]--; if(m > i && a[m-i]) { printf("%d %d", i, m - i); return 0; } a[i]++; } } printf("No Solution"); return 0;}
- 1048. Find Coins (25)-PAT甲级真题(Hash散列)
- 1048. Find Coins (25)-PAT甲级真题
- 【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)
- 1041. Be Unique (20)-PAT甲级真题(Hash散列)
- 1068. Find More Coins (30)-PAT甲级真题(01背包)
- 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)
- plsql异常写法
- iOS-规范-头文件结构
- expect 学习笔记
- HDU1024-Max Sum Plus Plus(dp)
- mac U盘安装系统(原系统被抹掉)
- 1048. Find Coins (25)-PAT甲级真题(Hash散列)
- 【HTML】菊花文、边框文和喷射尾巴的原理
- Intel IPP图像库手册函数概述
- Spring事务管理
- 单源最短路径—Dijkstra算法(C++)
- 致——懦弱的我
- 动态规划(3)最短编辑距离
- @class #import #include辨析
- poj 2248 Addition Chains(迭代加深搜索)