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.
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).
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).
7 j......
jolteon
7 ...feon
leafeon
7 .l.r.o.
flareon
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"}
题目很简单,注意到长度为6的只有espeon,长度为8的只有vaporeon,这两个单独处理,另外6个可以拿for 来一个个匹配,匹配度最高的即为答案。
代码实现
#include<iostream>
#include<cstdio>
using namespace std;
char s[10];
char a[][10]={"jolteon","flareon","umbreon","leafeon","glaceon","sylveon"};
int b[6]; int k=0;
int main(){
int n=0;
cin >> n;
cin >> s;
if (n==6) cout << "espeon" ;
else if (n==8) cout << "vaporeon";
else {
for(int i=0;i<=5;++i)
for (int j=0;j<=6;++j) if (a[i][j]==s[j]) ++b[i];
int l=0;
for (int i=0;i<=5;++i) if (b[i]>l) {
k=i; l=b[i];
}
cout << a[k] << endl;
}
//printf("%s", __VERSION__);
return 0;
}
最后说一点……那个被我注释掉的是查看GCC版本号的代码。我在编译的时候遇到一点小问题,用这个测了下....