洛谷 P1603 斯诺登的密码

题目
先将题目的所有情况打个表，在将每个情况所对应的数字存到另一个数组。
因为总共6个单词所以直接暴力判断有没有就可以。
然后考虑一个贪心的思想：从小到的大给所有的数字排序，所组成的数字应是最小的。
剩下的处理输出就可以了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char dic[30][20]={"zero","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen", "twenty","a","both","another","first","second","third"};//对应
int di[30]={0,1,4,9,16,25,36,49,64,81,00,21,44,69,96,25,56,89,24,61,0,1,4,1,1,4,9};
unsigned long long int a[10],top,flag;
int i,j;
char s[100];
int main()
{
     for(i=1;i<=6;i++)
     {
          scanf("%s",&s);
          for(j=1;j<=26;j++)
          {
               if(!strcmp(s,dic[j]))
               {
                    a[++top]=di[j];
                    break;
               }
          }
      }
      sort(a+1,a+top+1);
      for(i=1;i<=top;i++)
      {
           if(flag)
           {
                printf("%.2d",a[i]);
           }
           else
           {
                if(a[i])
                { 
                     printf("%d",a[i]);
                     flag=1;
                }
            }
     }
     if(!flag)printf("0");
     return 0;
}