zoukankan      html  css  js  c++  java
  • 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 1.

    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<cstdio>
    #include<set>
    using namespace std;
    
    int main(){
        int n;
        set<int> a;
        scanf("%d",&n);
        while(n--){
            int temp,sum = 0;
            scanf("%d",&temp);
            do{
                sum += temp % 10;
                temp /= 10;            
            }while(temp!=0);
            a.insert(sum);
        }
        printf("%d
    ",a.size());
        for(set<int>::iterator it = a.begin(); it != a.end(); it++){
            if(it != a.begin()) printf(" ");
            printf("%d",*it);
        }
        return 0;
    }
  • 相关阅读:
    list转datatable c#
    按钮靠右css小结
    IE浏览器打印合格证相关问题
    vue项目插入视频-mp4
    vue项目bug-Couldn’t find preset "es2015"
    Mac打开swf文件
    mac+windows下从git上拉取项目及运行
    echarts.js制作中国地图
    前端数据可视化echarts.js
    vue-router 基本使用
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10453469.html
Copyright © 2011-2022 走看看