专栏首页mlCF---(452)A. Eevee

CF---(452)A. Eevee

A. Eevee

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight different pokemons: Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon, and Sylveon.

You know the length of the word in the crossword, and you already know some letters. Designers of the crossword made sure that the answer is unambiguous, so you can assume that exactly one pokemon out of the 8 that Eevee evolves into fits the length and the letters given. Your task is to find it.

Input

First line contains an integer n (6 ≤ n ≤ 8) – the length of the string.

Next line contains a string consisting of n characters, each of which is either a lower case english letter (indicating a known letter) or a dot character (indicating an empty cell in the crossword).

Output

Print a name of the pokemon that Eevee can evolve into that matches the pattern in the input. Use lower case letters only to print the name (in particular, do not capitalize the first letter).

Sample test(s)

Input

7 j......

Output

jolteon

Input

7 ...feon

Output

leafeon

Input

7 .l.r.o.

Output

flareon

Note

Here's a set of names in a form you can paste into your solution:

["vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"]

{"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"}

给你一个稀疏的字符串,告诉你长度,然后要你在已知的8个字符串下进行匹配..........

代码:

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 using namespace std;
 5 struct node{
 6   int len;
 7   char ss[9];
 8 };
 9 node str[]={
10   {8,"vaporeon"},
11   {7,"jolteon"},
12   {7,"flareon"},
13   {6, "espeon"},
14   {7,"umbreon"},
15   {7,"leafeon"},
16   {7,"glaceon"},
17   {7,"sylveon"}
18 };
19 int main()
20 {
21   int n;
22   char ss[10];
23 //freopen("test.in","r",stdin);
24   while(scanf("%d%s",&n,ss)!=EOF)
25       for(int i=0;i<8;i++){
26           if(n==str[i].len){
27               bool flag=true;
28             for(int j=0;j<n;j++){
29               if(ss[j]!='.'&&ss[j]!=str[i].ss[j]){
30                  flag=false;
31                    break;
32                 }
33             }
34             if(flag){
35              printf("%s\n",str[i].ss);
36              break;
37             }
38           }
39       }
40   return 0;
41 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • poj-------------(2752)Seek the Name, Seek the Fame(kmp)

    Seek the Name, Seek the Fame Time Limit: 2000MS Memory Limit: 65536K Tot...

    Gxjun
  • hdu----(1950)Bridging signals(最长递增子序列 (LIS) )

    Bridging signals Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/3...

    Gxjun
  • HDUOJ-------2493Timer(数学 2008北京现场赛H题)

    Timer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Jav...

    Gxjun
  • poj-------------(2752)Seek the Name, Seek the Fame(kmp)

    Seek the Name, Seek the Fame Time Limit: 2000MS Memory Limit: 65536K Tot...

    Gxjun
  • 基于最大主曲率算法和欧氏距离的指静脉识别 -----附带源码和解析文档

      暑假了就有时间写写博客了,大一的师弟们也要进入算法的领域了,于是我就写了一个简略版基于最大主曲率算法的指静脉识别给他们入门用,

    徐飞机
  • Common Pitfalls to Avoid when using HTML5 Application Cache

    Application Cache, also known as AppCache, has been a pretty hot topic with web ...

    IMWeb前端团队
  • Common Pitfalls to Avoid when using HTML5 Application Cache

    Application Cache, also known as AppCache, has been a pretty hot topic with web ...

    IMWeb前端团队
  • POJ-2029 Get Many Persimmon Trees(动态规划)

    Get Many Persimmon Trees Time Limit: 1000MS Memory Limit: 30000K Total ...

    ShenduCC
  • POJ-1926 Pollution

    Pollution Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 40...

    ShenduCC
  • What is PCA ?

    figure cited here, recommend reading: A step by step explanation of Principal Co...

    杨熹

扫码关注云+社区

领取腾讯云代金券