1120 Friend Numbers-PAT甲级

最新推荐文章于 2022-11-12 18:25:56 发布

原创最新推荐文章于 2022-11-12 18:25:56 发布 · 190 阅读

0 ·

CC 4.0 BY-SA版权

pat甲级专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一种称为“友数”的概念，即两个数如果它们的各位数字之和相同，则这两个数被称为友数。文章提供了一个使用C++编写的程序，该程序能够接收一组正整数作为输入，并计算这些数中不同友数ID的数量，同时输出所有不同的友数ID，按升序排列。通过使用set集合，代码实现了自动排序并确保结果中没有重复。

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

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

很简单的一道题，求输入的数的各位数字的和，利用set集合自动排序且结果不重复

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
int n;
set<int>st;
int main(){
	cin>>n;
	int x;
	while(n--){
		cin>>x;
		int sum=0;
		while(x){
			sum+=x%10;
			x/=10;
		}
		st.insert(sum);
	}
	cout<<st.size()<<endl;
	int flag=0;
	for(auto i=st.begin();i!=st.end();i++){
		if(flag) cout<<" ";
		flag=1;
		cout<<*i;
	}
	cout<<endl;
	return 0;
}