A1120 Friend Numbers (20) 简单题

#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> ans;
bool hashtable[40]={false};
int change(int x)
{
    int i=0;
    while(x>0)
    {

        i+=(x%10);
        x/=10;
    }
    return i;
}
int main()
{
    int n,num,t;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&num);
        t=change(num);
        if(hashtable[t]==false)
        {
            hashtable[t]=true;
            ans.push_back(t);
        }
    }
    printf("%d\n",ans.size());
    sort(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++)
    {
        printf("%d",ans[i]);
        if(i!=ans.size()-1)
            printf(" ");
    }
}