PAT 1120

水题，把数字逐位相加，得出所有不重复的和、

#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<string.h>
#include<set>
#include<algorithm>
#include<queue>
using namespace std;
#define N 100005


int main()
{
	set<int>s;
	int n, i,j;
	string str[N];
	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		cin >> str[i];
	}
	int sum = 0;
	for (i = 0; i < n; i++) {
		for (j = 0; j < str[i].length(); j++) {
			sum += str[i][j]-'0';
		}
		s.insert(sum);
		sum = 0;
	}
	set<int>::iterator itr;
	cout << s.size()<<endl;
	for (itr = s.begin(); itr != s.end(); itr++) {
		if(itr==(--s.end()))
		cout << *itr<<endl;
		else
		cout << *itr << " ";
	}
	return 0;
}