MemSQL Start[c]UP 2.0 - Round 1 .A
2014-07-28 19:28
429 查看
A. Eevee
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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).
Output
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).
Sample test(s)
input
output
input
output
input
output
Note
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"}
简单题。
AC code:
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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).
Output
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).
Sample test(s)
input
7 j......
output
jolteon
input
7 ...feon
output
leafeon
input
7 .l.r.o.
output
flareon
Note
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"}
简单题。
AC code:
#include <iostream> #include <string> using namespace std; int main() { int n; string str[8]={"vaporeon","jolteon","flareon","espeon","umbreon","leafeon","glaceon","sylveon"}; string s; int i,j; while(cin>>n) { cin>>s; for(i=0;i<8; i++) { int len = str[i].length(); if(len==n) { j=0; while(j!=n) { if(s[j]!='.') { if(s[j]!=str[i][j]) { break; } } j++; } if(j==n) { cout<<str[i]<<endl; break; } } } } return 0; }
相关文章推荐
- MemSQL Start[c]UP 2.0 - Round 1 D. Washer, Dryer, FoldercO
- MemSQL Start[c]UP 2.0 - Round 1 B. 4-point polyline (线段的 枚举)
- codeforces MemSQL Start[c]UP 2.0 - Round 1 A. Eevee
- codeforces MemSQL Start[c]UP 2.0 - Round 1 B. 4-point polyline
- MemSQL Start[c]UP 2.0 - Round 1
- MemSQL Start[c]UP 2.0 - Round 2 - Online Round(数学:高精度)
- MemSQL Start[c]UP 2.0 - Round 2 - Online Round
- MemSQL Start[c]UP 2.0 - Round 1
- [Hash] Codeforces 452F MemSQL Start[c]UP 2.0 - Round 1 F. Permutation
- MemSQL Start[c]UP 2.0 - Round 2 - Online Round 题解
- MemSQL Start[c]UP 2.0 - Round 2 A
- MemSQL Start[c]UP 2.0 - Round 1(无聊练手B题)
- MemSQL Start[c]UP 2.0 - Round 2 - Online Round A,B,C
- MemSQL Start[c]UP 2.0 - Round 1A(构造)
- MemSQL Start[c]UP 2.0 - Round 1
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) E
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) B.Save the Problem!
- Codeforces452F(MemSQL Start[c]UP 2.0)[Permutation]--线段树+Hash
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) C.Ordering Pizza
- CF memsql Start[c]UP 2.0 B