zoukankan      html  css  js  c++  java
  • CF---(452)A. Eevee

    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
    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"}

    给你一个稀疏的字符串,告诉你长度,然后要你在已知的8个字符串下进行匹配..........

    代码:

     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 using namespace std;
     5 struct node{
     6   int len;
     7   char ss[9];
     8 };
     9 node str[]={
    10   {8,"vaporeon"},
    11   {7,"jolteon"},
    12   {7,"flareon"},
    13   {6, "espeon"},
    14   {7,"umbreon"},
    15   {7,"leafeon"},
    16   {7,"glaceon"},
    17   {7,"sylveon"}
    18 };
    19 int main()
    20 {
    21   int n;
    22   char ss[10];
    23 //freopen("test.in","r",stdin);
    24   while(scanf("%d%s",&n,ss)!=EOF)
    25       for(int i=0;i<8;i++){
    26           if(n==str[i].len){
    27               bool flag=true;
    28             for(int j=0;j<n;j++){
    29               if(ss[j]!='.'&&ss[j]!=str[i].ss[j]){
    30                  flag=false;
    31                    break;
    32                 }
    33             }
    34             if(flag){
    35              printf("%s
    ",str[i].ss);
    36              break;
    37             }
    38           }
    39       }
    40   return 0;
    41 }
    View Code
  • 相关阅读:
    Jmeter自动化测试工具的简单使用--HTTP测试
    学习前端编程之前的一些建议
    深入浅出C#中的静态与非静态
    Jenkins 基于svn部署的两种方式
    粒子群基础
    python环境搭建:python3环境安装+pycharm工具使用
    python 空字符串是其他任何字符的子集
    文件复制 4种方法用时比较
    map,list,set的遍历方法
    JSP学习日记(四)
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3918683.html
Copyright © 2011-2022 走看看