【luogu1603】斯诺登的密码

problem

solution

codes

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
const string num[] = {
    "zero","one","two","three","four","five", "six","seven","eight",
    "nine","ten","eleven","twelve","thirteen","fourteen",
    "fifteen","sixteen","seventeen","eighteen","nineteen","twenty"
};
const string num2[]={ "0","a","both","another" };
const string num3[]={ "0","first","second","third" };
int main(){
    int n = 0, a[10], flag=0;
    for(int i = 0; i < 6; i++){
        string s;  cin>>s;
        int t = 0;
        for(int j = 0; j < 21; j++)if(s==num[j]){
            t = j*j%100; break;
        }
        for(int j = 1; j <= 3; j++){
            if(s==num2[j]){ t = j*j%100; break; }
            if(s==num2[j]){ t = j*j%100; break; }
        }
        if(t)flag = 1;
        a[n++] = t;
    }
    if(!flag){
        cout<<"0\n";
        return 0;
    }
    sort(a,a+n);
    int p = 0;
    while(a[p]==0)p++;
    cout<<a[p];
    for(int i = p+1; i < n; i++){
        if(a[i]>=10)cout<<a[i];
        else cout<<0<<a[i];
    }
    cout<<"\n";
    return 0;
}
  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80587482