洛谷 P1603 斯诺登的密码

#include <algorithm>
#include <iostream>
#include <string>
#include <map>
using namespace std;
string num[25]={"zero","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen","twenty"};
map<string,int>q;
string ans[25];
int a;
inline void init() {for(int i=1;i<=20;++i) q[num[i]]=i;q["a"]=1;}
bool cmp(string a,string b)
{
    return a+b<b+a;
}
int main()
{
    string word;
    init();
    for(;cin>>word;)
    {
        if(word==".") break;
        if(q[word])
        {
            int k=q[word]*q[word]%100;
            string now;
            int b[100],c=0;
            for(;k;k/=10) b[++c]=(k%10)+‘0‘;
            if(c==1) now+="0";
            for(int i=c;i>=1;--i) now+=b[i];
            ans[++a]=now;
        }
    }
    sort(ans+1,ans+1+a,cmp);
    int i=0;
    for(;ans[1][i]==‘0‘;++i);
    for(int j=i;j<ans[1].length();++j) cout<<ans[1][j];
    for(i=2;i<=a;++i) cout<<ans[i];
    if(a==0) cout<<0;
    return 0;
}