pat B1064

#include <stdio.h>#include <stdlib.h>#include <string.h>int cmp(const void * a,const void * b){  return *(int *)a  - *(int *)b  ;}int main(){  int i,num,val,s,sum=0,count=0,A[10000],Hash[10000]={0};  scanf("%d",&num);  for(i=0;i<num;i++)  {    sum=0;    scanf("%d",&val);    while(val)    {      s=val%10;      sum+=s;      val/=10;    }        if(Hash[sum]==0)//没有被标记的话    {        Hash[sum]=1;      A[count++]=sum;    }  }  printf("%d\n",count);  qsort(A,count,sizeof(A[0]),cmp);  for(i=0;i<count;i++)  {    printf("%d",A[i]);    if(i<count-1)      printf(" ");  }return 0;}