PAT A1120

AC代码如下

#include <iostream>
using namespace std;

const int max_n=10010;
int num[max_n]={0};
int ID[100]={0};

int friendID(int a){
	int sum = 0;
	do{
		sum+=a%10;
		a/=10;	
	}while(a);
	return sum;
}

int main(){
	int n,count=0;
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>num[i];
		if(ID[friendID(num[i])]==0) ID[friendID(num[i])]++;
	}
	for(int i = 0;i < 100 ;i++){
		if(ID[i]!=0) count++;
	}
	cout<<count<<endl;
	for(int i = 0;i < 100 ;i++){
		if(ID[i]!=0) {
			cout<<i;
			count--;
			if(count!=0){
				cout<<" ";
			}
		}
	}
	return 0;
}