codeforces 452A Eevee

#include<cstdio>#include<cstring>#include<cmath>#include<climits>#include<cctype>#include<cstdlib>#include<iostream>#include<algorithm>#include<queue>#include<vector>#include<map>#include<set>#include<string>#include<stack>#define ll long long#define MAX 1000#define INF INT_MAX#define eps 1e-8using namespace std;char t[100];char s[][100] = {"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"};int main(){int n;while (scanf("%d",&n) != EOF){scanf("%s",t);for (int i=0; i<8; i++){int len = strlen(s[i]);if (len != n) continue;int j;for (j=0; j<n; j++){if (t[j] == '.' || s[i][j] == t[j]) continue;else break;}if (j >= n) {printf("%s\n",s[i]);break;}}}return 0;}