1120 Friend Numbers

最新推荐文章于 2021-09-30 12:35:29 发布

原创最新推荐文章于 2021-09-30 12:35:29 发布 · 110 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat #set

PAT甲级题解专栏收录该内容

86 篇文章

订阅专栏

本文介绍了一种称为“友数”的概念，即两个整数如果它们的数字之和相同，则被认为是友数，这个和被称为友ID。文章提供了一个算法，用于计算一组给定整数中不同的友ID数量，并按升序输出这些友ID。示例输入包含8个整数，输出显示存在4个不同的友ID。

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

1120 Friend Numbers
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 10
4
.

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
参考代码：

#include<iostream>
#include<set>
#include<vector>
using namespace std;
int sum_digits(int n) {
	vector<int>v;
	int sum = 0;
	do {
		v.push_back(n % 10);
		n /= 10;
	} while (n != 0);
	for (auto val : v)
		sum += val;
	return sum;
}
int main() {
	int n, temp, flag = 0;
	set<int>s;
	scanf_s("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf_s("%d", &temp);
		s.insert(sum_digits(temp));
	}
	cout << s.size() << endl;
	for (auto val : s) {
		if (flag)cout << " ";
		cout << val; flag = 1;
	}

	return 0;
}