1120 Friend Numbers (20)

标签：return   ted   div   ESS   color   next   case   order   保存   

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^4^.

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

题目大意：给出一串数字，找出各位数之和不同的个数，并按照升序把这些和输出；
思路：用string类型保存输入的值，便于各位数字的和

 1 #include<iostream>
 2 #include<algorithm>
 3 #include<vector>
 4 using namespace std;
 5 int main(){
 6   int n, i;
 7   cin>>n;
 8   vector<int> v, visited(42,0);
 9   for(i=0; i<n; i++){
10     string s;
11     int sum=0;
12     cin>>s;
13     for(int j=0; j<s.size(); j++) sum += (s[j]-‘0‘);
14     if(visited[sum]==0){v.push_back(sum); visited[sum]=1;}
15   }
16   sort(v.begin(), v.end());
17   cout<<v.size()<<endl;
18   for(i=0; i<v.size(); i++){
19     if(i==0) cout<<v[i];
20     else cout<<" "<<v[i];
21   }
22   return 0;
23 }

1120 Friend Numbers (20)

标签：return   ted   div   ESS   color   next   case   order   保存   

原文地址：https://www.cnblogs.com/mr-stn/p/9160634.html