PAT A1048. Find Coins (25)
来源:互联网 发布:socket网络编程视频 编辑:程序博客网 时间:2024/05/17 10: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 <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <map>#include <string>#define Max 20000using namespace std;int main(){int n,m;int S[1001]={0};scanf("%d %d",&n,&m);int f=0,min=501;int k;for(int i=0;i<n;i++){scanf("%d",&k);S[k]++;;if(S[m-k]!=0&&m-k!=k&&m-k>0){if(k<min) min=k;if((m-k)<min) min=m-k;}else if(k==m-k&&S[k]%2==0&&S[k]>=2){if(k<min) min=k;}}if(min==501) printf("No Solution\n");else printf("%d %d\n",min,m-min); system("pause");return 0;}
- PAT-A1048. Find Coins (25)
- PAT A1048. Find Coins (25)
- A1048. Find Coins
- PAT-Find Coins (25)
- 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 A1048
- PAT-A1048
- 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 甲级
- java基本语法之 javadoc02
- JAVA操作Excel时文字自适应单元格的宽度设置方法
- 状态机思路在程序设计中的应用
- 使用curl进行模拟登录
- 栈
- PAT A1048. Find Coins (25)
- 20170212 pm html
- 《Java虚拟机》必知必会——十四个问题总结(内存模型+GC)
- 配置SonarQube,Jenkins集成扫描Android项目
- 相思风雨中
- 入门级别spring案例
- 2.CSS图像绘制之:菜单按钮
- 每日一道编程题——求比当前数值大的新排列
- mybatis 缓存