pat 1120 Friend Numbers（20 分）

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

转载最新推荐文章于 2020-02-15 11:13:32 发布 · 103 阅读

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/GetcharZp/p/9581928.html

本文解析了一个算法问题，即如何找出一组数字中不同的友数ID数量及其具体数值。友数是指两个整数如果它们的各位数字之和相同，则这两个数被称为友数，这个和就是它们的友数ID。文章通过一个具体的样例输入和输出，展示了如何使用C++编程语言解决这个问题，包括读取输入数据，计算每个数字的友数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

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

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstdio>
 4 #include <cstring>
 5 #include <map>
 6 #include <stack>
 7 #include <vector>
 8 #include <queue>
 9 #include <set>
10 using namespace std;
11 const int MAX = 100;
12 
13 int A[MAX] = {0}, n, cnt = 0, a, temp;
14 
15 int main()
16 {
17 //    freopen("Date1.txt", "r", stdin);
18     scanf("%d", &n);
19     for (int i = 1; i <= n; ++ i)
20     {
21         scanf("%d", &a);
22         int x = 0;
23         while (a)
24         {
25             x += a % 10;
26             a /= 10;
27         }
28         A[x] ++;
29         if (A[x] == 1) ++ cnt;
30     }
31 
32     printf("%d\n", cnt);
33     for (int i = 0; i <= 40; ++ i)
34         if (A[i] >= 1)
35         {
36             temp ++;
37             printf("%d%c", i, temp == cnt ? '\n' : ' ');
38         }
39     return 0;
40 }

转载于:https://www.cnblogs.com/GetcharZp/p/9581928.html