PAT 1120 Friend Numbers[简单]

最新推荐文章于 2019-08-25 22:05:52 发布

weixin_30438813

最新推荐文章于 2019-08-25 22:05:52 发布

阅读量80

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/BlueBlueSea/p/9841548.html

本文介绍了一种称为“友好数”的数学概念，即两个数如果各位数字之和相同，则它们共享同一友好数。通过C++编程语言，使用map数据结构实现了对一组数中不同友好数的计数及输出。代码示例展示了如何计算给定整数的各位数字之和，并利用map来记录每种友好数出现的情况。

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

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

题目大意：两个数如果每位相加结果相等，那么结果就是个友好数，现在给出几个数，求他们的友好数。

//就算一个数没有和别的单位数和一样的，也将这个算作友好数。

//我的AC

#include <iostream>
#include <map>
using namespace std;

int main() {
    int n;
    map<int,int> mp;
    cin>>n;
    int t;
    for(int i=0;i<n;i++){
        cin>>t;
        int x,sum=0;
        while(t!=0){
            x=t%10;
            t/=10;
            sum+=x;
        }
        mp[sum]=1;
        sum=0;
    }
    cout<<mp.size()<<'\n';
    for(auto it=mp.begin();it!=mp.end();){
        cout<<it->first;//每次都不知道这里的空格该怎么控制？！！！
        if(++it!=mp.end())
            cout<<" ";
    }
    return 0;
}