【笨方法学PAT】1048 Find Coins （25 分）

最新推荐文章于 2023-05-29 21:18:44 发布

linghugoogle1

最新推荐文章于 2023-05-29 21:18:44 发布

阅读量190

点赞数

分类专栏： PAT 文章标签： C PAT甲级

本文链接：https://blog.csdn.net/linghugoolge/article/details/83622876

版权

PAT 专栏收录该内容

143 篇文章 2 订阅

订阅专栏

一、题目

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成立。

三、考点

哈希、散列

四、注意

1、使用num数组保存出现的数字；

2、给的第二个测试点帮助了i=i的情况的处理。

五、代码

#include<iostream>
#define N 1010
using namespace std;
int main() {
	//read
	int n, m;
	cin >> n >> m;

	int num[N] = { 0 };
	while (n--) {
		int a;
		cin >> a;
		if (a > m)
			continue;
		else
			num[a]++;
	}

	//solve
	bool flag = false;
	for (int i = 1; i < m; ++i) {
		if (num[i] != 0 && num[m - i] != 0) {
			//i=i
			if (i + i == m) {
				if (num[i] >= 2) {
					flag = true;
					cout << i << " " << m - i << endl;
					break;
				}
			}

			//i!=i
			else {
				flag = true;
				cout << i << " " << m - i << endl;
				break;
			}
		}
	}

	//output
	if (flag == false) {
		cout << "No Solution";
	}

	system("pause");
	return 0;
}