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

本文主要是介绍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;
}

这篇关于codeforces MemSQL Start[c]UP 2.0 - Round 1 A. Eevee的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---