A1120 Friend Numbers （20 分）

#include<cstdio>
#include<set>
using namespace std;
int n,temp;
set<int> s;
int change(int x)
{
	int result = 0;
	while (x != 0)
	{
		result += x % 10;
		x /= 10;
	}
	return result;
}
int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &temp);
		int value = change(temp);
		s.insert(value);
	}
	printf("%d\n", s.size());
	int num = 0;
	for (set<int>::iterator it=s.begin();it!=s.end();it++)
	{
		printf("%d", *it);
		num++;
		if (num != s.size()) printf(" ");
	}
	return 0;
}