CodeForces 452A Eevee
来源:互联网 发布:hadoop云计算平台 编辑:程序博客网 时间:2024/05/24 05:58
Description
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 Input
7j......
jolteon
7...feon
leafeon
7.l.r.o.
flareon
Hint
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"}
#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;int main(){char s[][50]={"vaporeon", "jolteon","flareon" , "espeon","umbreon", "leafeon", "glaceon", "sylveon"};int len[]={8,7,7,6,7,7,7,7};int n,i,j,k,l,m,flag,ans;char str[50];while(scanf("%d",&n)!=EOF){scanf("%s",str);for(i=0;i<8;i++){if(len[i]==n){flag=0; for(j=0;j<n;j++) { if(str[j]!='.'&&str[j]!=s[i][j]) { flag=1; break; } } if(flag==0) ans=i;}}printf("%s\n",s[ans]);}return 0;}
- codeforces 452A Eevee
- Codeforces 452A Eevee
- Codeforces 452 A. Eevee
- CodeForces 452A Eevee
- A. Eevee
- A. Eevee
- CF 452A(Eevee-直接试)
- codeforces MemSQL Start[c]UP 2.0 - Round 1 A. Eevee
- 452A - Eevee 模拟字符串,挺简单的一道题
- cf452A Eevee
- CodeForces-a
- Codeforces 903A A
- Problem - 452A - Codeforces解题报告
- Codeforces Round #452 (Div. 2) A-C
- Codeforces Round #452 (Div. 2) A
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- Linux常用命令及操作(二)查看用户组、更改文件(夹)权限、复制、将用户添加到root
- JSP中文乱码总结
- [Spring]Spring容器扩展点
- 第一个使用Spring Tool Suite(STS)和Maven建立的Spring mvc 项目
- 如何加载StoryBoard
- CodeForces 452A Eevee
- 堆排序
- RMQ(各方归纳)
- DOS命令行
- iOS加载本地html,css样式失效问题
- r语言之极坐标线图
- SVN
- iOS NSOperation高级使用
- Spring学习笔记(二十): eclipse或Myeclipse中web项目没有run on server