PAT-A-1048. Find Coins (25)
来源:互联网 发布:物联网数据卡 编辑:程序博客网 时间:2024/05/22 12:03
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<iostream>#include<cstdio>using namespace std;int main(){ int a[1001] = { 0 }; int n, m; int v; cin >> n >> m; int num; for (int i = 0; i < n; i++) { cin >> num; a[num]++; } int flag = 0; for (int i = 1; i < 501; i++) { if (a[i] && a[m - i]) { flag = 1; v = i; break; } } if (v == m - v&&a[v]<2) flag = 0; if (flag) cout << v << " " << m - v << endl; else cout << "No Solution" << endl; system("pause"); return 0;}
- PAT(A) - 1048. Find Coins (25)
- PAT-A 1048. Find Coins (25)
- PAT-A-1048. Find Coins (25)
- PAT-A 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 1048. Find Coins (25)
- PAT 1048.Find Coins
- 【PAT】1048. Find Coins
- PAT--1048. Find Coins
- PAT 1048. Find Coins
- PAT-Find Coins (25)
- PAT (Advanced) 1048. Find Coins (25)
- PAT甲 1048. Find Coins (25)
- hpp文件与h文件
- android平台短视频技术之视频编辑的经验分享
- 调试耗时——旋转矩阵
- 部署Jenkins
- 【Maven】持续交付环境中,组件工程依赖管理的配置与检查
- PAT-A-1048. Find Coins (25)
- 全栈之路初印象
- JavaScript实现瀑布流布局
- DNS
- Struts2的运行流程及其工作原理
- fzu 2213 通过圆心坐标和半径判断两圆的关系
- 嵌入式视频方案学习第二篇——Hi3518E介绍
- 贪吃蛇练习项目
- 无人机学习笔记1:基于Crazyfile源码