1120. Friend Numbers

#include <stdio.h>
#include <stdlib.h>
int GetID(int x);
int comp(const void*a, const void *b);
int main()
{
	int n, i, num,ID[10000],cnt=1;
	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		scanf("%d", &num);
		ID[i] = GetID(num);
	}
	qsort(ID, n,sizeof(int),comp);
	for (i = 1; i < n; i++)
		if (ID[i] != ID[i - 1])
			cnt++;
	printf("%d\n%d", cnt,ID[0]);
	for (i = 1; i < n; i++)
		if (ID[i] != ID[i - 1])
			printf(" %d", ID[i]);
	return 0;
}

int GetID(int x)
{
	int id=0, num = x;
	while (num) {
		id += num % 10;
		num /= 10;
	}
	return id;
}

int comp(const void*a, const void *b)
{
	return *(int*)a - *(int*)b;
}