1048. Find Coins (25)
来源:互联网 发布:ubuntu 退出vim 编辑:程序博客网 时间:2024/06/01 09:11
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
提交代码
散列的方法
#include<stdio.h>int hashTable[1010];int main(){int n,m,x;scanf("%d%d",&n,&m);for(int i=0;i<n;i++){scanf("%d",&x);++hashTable[x];}for(int i=0;i<1001;i++){if(hashTable[i]&&hashTable[m-i]){if(i==m-i&&hashTable[m-i]<=1){continue;}printf("%d %d\n",i,m-i);return 0; } }printf("No Solution");return 0;}
two pointers的思想
#include<stdio.h> #include<algorithm>using namespace std;int main() { int n,m,x,a[100010]; scanf("%d%d",&n,&m); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); int i=0,j=n-1; while(i<j) { if(a[i]+a[j]==m) { printf("%d %d",a[i],a[j]); break;}else if(a[i]+a[j]<m){i++;}else{j--;}}if(i==j){ printf("No Solution"); } return 0; }
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- pat-a1110. Complete Binary Tree (25)
- 字符串右旋 、 字符串去重
- 小白学tkinter(LabelFrame组件)
- 【React】ReactDOM.render源码分析
- Latex 表格 table 宽度太长
- 1048. Find Coins (25)
- JavaSE
- Python数据分析与展示(5)——Pandas库入门
- Unity3d:使用C#脚本生成与解析XML
- 51Nod-1610-路径计数
- 求助,帮忙设计基于stm32的地图导航
- linux驱动链表的使用
- 手残,双硬盘(SSD+HDD)双系统(Win10+ubuntu)用easyBCD删除win10引导项怎么办?戳这里
- jquery 中stop()方法总结