1120 Friend Numbers （20 分）

友数计算与统计

最新推荐文章于 2021-02-26 12:55:12 发布

原创最新推荐文章于 2021-02-26 12:55:12 发布 · 267 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲专栏收录该内容

53 篇文章

订阅专栏

本文介绍了一种算法，用于计算并统计一组整数中不同友数ID的数量。友数是指两个整数如果它们的数字之和相同，则这两个数互为友数，其数字之和即为友数ID。通过输入一系列整数，该算法能够找出所有不同的友数ID，并按升序输出。

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

#include<iostream>
#include<set>
#include<vector>
using namespace std;
int main(){
	int n;
	set<int> v;
	cin >> n;
	for(int i = 0;i < n;i++){
		string s;
		cin >> s;
		int sum = 0;
		for(int j = 0;j < s.length();j++){
			sum += (s[j]-48);
		}
		//cout << sum << " ";
		v.insert(sum);
	}
	int flag = 0;
	cout << v.size() << endl;
	for(auto it=v.begin();it != v.end();it++){
		if(!flag){
			cout << *it;
			flag=1;
		}else{
			cout << " " << *it;
		}
	}
	cout << endl;
	return 0;
}