codeforces MemSQL Start[c]UP 2.0 - Round 1 A. Eevee

又一次与暴涨rating失之交臂,居然跪在了第1题

忘了判断字符串的长度了...

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 10010
#define LL long long
using namespace std;

string str[MAXN] = {"vaporeon", "jolteon", "flareon", "espeon", "umbreon", "leafeon", "glaceon", "sylveon"};

int main(void) {
    int n, cnt, ans, i, j;
    string t;
    while(cin >> n >> t) {
        cnt = ans = 0;
        for(i=0; i<t.size(); ++i) {
            if(t[i] != '.')
                cnt++;
        }
        for(i=0; i<8; ++i) {
            for(j=0; j<t.size(); ++j) {
                if(t[j] != '.') {
                    if(str[i][j] == t[j]) {
                        ans++;
                    }
                }
            }
            if(ans == cnt && t.size()==str[i].size()) {
                cout << str[i] << endl;
                break;
            }
            ans = 0;
        }
    }
    return 0;
}