PAT甲级——1120 Friend Numbers （又是set的应用)

最新推荐文章于 2020-02-15 11:13:32 发布

原创最新推荐文章于 2020-02-15 11:13:32 发布 · 144 阅读

0 ·

CC 4.0 BY-SA版权

PAT (Advanced Level) Practice 专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一种计算方法，用于确定一组整数中不同友数ID的数量，并按升序输出这些友数ID。友数是指两个数的各位数字之和相同，这个和被称为友数ID。文章提供了一个C++实现示例，展示了如何使用set数据结构来存储并统计不同的友数ID。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1120 Friend Numbers （20 分)

Two integers are called "friend numbers" if they share the same sum of their digits, and the sum is their "friend ID". For example, 123 and 51 are friend numbers since 1+2+3 = 5+1 = 6, and 6 is their friend ID. Given some numbers, you are supposed to count the number of different frind ID's among them.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N. Then N positive integers are given in the next line, separated by spaces. All the numbers are less than 104.

Output Specification:

For each case, print in the first line the number of different frind ID's among the given integers. Then in the second line, output the friend ID's in increasing order. The numbers must be separated by exactly one space and there must be no extra space at the end of the line.

Sample Input:

8
123 899 51 998 27 33 36 12

Sample Output:

4
3 6 9 26

水题~

有N个整数，对于每个数求它的friend ID，就是把它的每一位上的数字加起来的和，按照从小到大的顺序输出，结果不能重复。

#include <iostream>
#include <set>
#include <vector>
using namespace std;
int getNum(int n);
int main()
{
	int N;
	set <int> ans;
	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		int n;
		scanf("%d", &n);
		ans.insert(getNum(n));
	}
	printf("%d\n", ans.size());
	for (auto it = ans.begin(); it != ans.end(); it++) {
		if (it != ans.begin())
			printf(" ");
		printf("%d", *it);
	}
}
int getNum(int n) {
	int sum = 0;
	vector <int> v;
	while (n) {
		v.push_back(n % 10);
		n = n / 10;
	}
	for (int i = 0; i < v.size(); i++)
		sum += v[i];
	return sum;
}