Codeforces 452A Eevee

nenu_xlp

于 2014-07-29 10:01:43 发布

阅读量794

点赞数 1

分类专栏： Codeforces 字符串模拟

本文链接：https://blog.csdn.net/nenuxlp/article/details/38259037

版权

模拟同时被 3 个专栏收录

47 篇文章 0 订阅

订阅专栏

Codeforces

34 篇文章 0 订阅

订阅专栏

字符串

2 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
using namespace std;
string m[]={"vaporeon","jolteon","flareon","espeon","umbreon","leafeon","glaceon","sylveon"};
int len[]={8,7,7,6,7,7,7,7};
int main()
{
    int n,ans;
    char s[20];
    scanf("%d%s",&n,s);
    for(int i=0;i<8;i++)
    {
        if(len[i]==n)
        {
            int flag=0;
            for(int j=0;j<n;j++)
            {
                if(s[j]!='.'&&s[j]!=m[i][j])
                {
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                ans=i;
                break;
            }
        }
    }
    cout<<m[ans]<<endl;
    printf("\n");
	return 0;
}