MemSQL Start[c]UP 2.0 - Round 1

A. Eevee http://codeforces.com/contest/452/problem/A

字符串水题

 1 #include<cstdio>
 2 #include<cstring>
 3 using namespace std;
 4 const int M=16;
 5 char a[16][M]={"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"};
 6 char b[M];
 7 int main(){
 8     int n;
 9     while(~scanf("%d",&n)){
10         scanf("%s",b);
11         for(int i=0;i<8;i++){
12             int la=strlen(a[i]);
13             if(la==n){
14                 bool flag=true;
15                 for(int j=0;j<n;j++){
16                     if(b[j]!='.'&&b[j]!=a[i][j]){
17                         flag=false;
18                         break;
19                     }
20                 }
21                 if(flag){
22                     puts(a[i]);
23                     break;
24                 }
25             }
26         }
27     }
28     return 0;
29 }

View Code