1120 Friend Numbers (20 分)
#include <iostream>
using namespace std;
int a[100];
int main(){
int n, ret = 0, f = 0, x;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> x;
int sum = 0;
while(x){
sum += x % 10;
x /= 10;
}
a[sum] = 1;
}
for(int i = 0; i < 100; ++i)
if(a[i])
ret++;
cout << ret << endl;
for(int i = 0; i < 100; ++i){
if(a[i]){
if(f)
cout << " ";
cout << i;
f = 1;
}
}
}