zoukankan      html  css  js  c++  java
  • 1120 Friend Numbers

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

    思路:

      将各个数字的各位上的和相加存储在一个set中,然后输出即可。

    Code:

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 int main() {
     6     int n, t;
     7     cin >> n;
     8 
     9     set<int> s;
    10     int ans;
    11     for (int i = 0; i < n; ++i) {
    12         cin >> t;
    13         ans = 0;
    14         while (t) {
    15             ans += t % 10;
    16             t /= 10;
    17         }
    18         s.insert(ans);
    19     }
    20     cout << s.size() << endl;
    21     bool isFirst = true;
    22     for (int i : s) {
    23         if (isFirst) {
    24             cout << i;
    25             isFirst = false;
    26         } else {
    27             cout << " " << i;
    28         }
    29     }
    30     cout << endl;
    31     return 0;
    32 }

      

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    JVM三部曲之运行时数据区 (第一部)
    c++鼠标点点,获取坐标值,放入到txt文件中
    自己实现的SVM源码
    SVM资料
    caffe源码解析
    caffe调试小结2
    caffe中卷积层和pooling层计算下一层的特征map的大小
    gpu对任意长度的矢量求和
    caffe代码调试小结
    caffe添加自己的层
  • 原文地址:https://www.cnblogs.com/h-hkai/p/12763017.html
Copyright © 2011-2022 走看看