1120 Friend Numbers (20 分)

本文主要是介绍1120 Friend Numbers (20 分)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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 friend 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

set的应用

#include<bits/stdc++.h>
using namespace std;
int main() {int n, num, temp;set<int> s;scanf("%d", &n);for (int i = 0; i < n; i++) {scanf("%d", &num);temp = 0;while (num > 0) {temp += num % 10;num /= 10;}s.insert(temp);}printf("%d\n", s.size());for (auto it = s.begin(); it != s.end(); it++) {if (it != s.begin()) printf(" ");printf("%d", *it);}
}

这篇关于1120 Friend Numbers (20 分)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---