1120. Friend Numbers

最新推荐文章于 2020-07-17 23:17:16 发布

原创最新推荐文章于 2020-07-17 23:17:16 发布 · 190 阅读

0 ·

CC 4.0 BY-SA版权

编程题目专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种通过计算整数各位数字之和来确定“友数”及其“友ID”的方法，并提供了一个C++实现示例，用于统计一组整数中不同友ID的数量并按升序输出这些友ID。

1120. Friend Numbers (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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. Note: a number is considered a friend of itself.

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⁴.

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<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<set>
#define MAXSIZE 100
using namespace std;
set<int> out;
int calSum(int N)
{
    int i=0,temp=0;
    while(N)
    {
        temp+=N%10;
        N=N/10;
        i++;
    }
    return temp;
}
int main()
{
    int N,M;
    cin>>N;
    while(N--)
    {
        cin>>M;
        int index=calSum(M);
        out.insert(index);
    }
    cout<<out.size()<<endl;
    for(set<int>::iterator it =out.begin();it!=out.end();it++)
    {
        if(it!=out.begin())
            cout<<" ";
        cout<<*it;
    }


    return 0;
}