Codeforces 452 A. Eevee

题目链接:http://codeforces.com/contest/452/problem/A
提示:模拟题,水

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
char s[20];
int main()
{
    int m;
    while(cin>>m>>s)
    {
        int len=strlen(s);
        if((s[0]=='j'||s[0]=='.')&&(s[1]=='o'||s[1]=='.')&&(s[2]=='l'||s[2]=='.')
           &&(s[3]=='t'||s[3]=='.')&&len==7)
           puts("jolteon");
        else if((s[0]=='v'||s[0]=='.')&&(s[1]=='a'||s[1]=='.')&&(s[2]=='p'||s[2]=='.')
                &&(s[3]=='o'||s[3]=='.')&&(s[4]=='r'||s[4]=='.')&&len==8)
            puts("vaporeon");
        else if((s[0]=='f'||s[0]=='.')&&(s[1]=='l'||s[1]=='.')&&(s[2]=='a'||s[2]=='.')
                &&(s[3]=='r'||s[3]=='.')&&len==7)
            puts("flareon");
        else if((s[0]=='e'||s[0]=='.')&&(s[1]=='s'||s[1]=='.')&&(s[2]=='p'||s[2]=='.')
                &&len==6)
            puts("espeon");
        else if((s[0]=='u'||s[0]=='.')&&(s[1]=='m'||s[1]=='.')&&(s[2]=='b'||s[2]=='.')
                &&(s[3]=='r'||s[3]=='.')&&len==7)
            puts("umbreon");
        else if((s[0]=='l'||s[0]=='.')&&(s[1]=='e'||s[1]=='.')&&(s[2]=='a'||s[2]=='.')
                &&(s[3]=='f'||s[3]=='.')&&len==7)
            puts("leafeon");
        else if((s[0]=='g'||s[0]=='.')&&(s[1]=='l'||s[1]=='.')&&(s[2]=='a'||s[2]=='.')
                &&(s[3]=='c'||s[3]=='.')&&len==7)
            puts("glaceon");
        else if((s[0]=='s'||s[0]=='.')&&(s[1]=='y'||s[1]=='.')&&(s[2]=='l'||s[2]=='.')
              &&(s[3]=='v'||s[3]=='.')&&len==7)
            puts("sylveon");
    }
    return 0;
}
时间: 2024-08-01 15:45:54

Codeforces 452 A. Eevee的相关文章

Codeforces Round #157 (Div. 1) C. Little Elephant and LCM (数学、dp)

C. Little Elephant and LCM time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output The Little Elephant loves the LCM (least common multiple) operation of a non-empty set of positive integers. The

Codeforces B. Taxi 算法题解

简单总结题意: 有一个数组,数组中的数值不会大于4,即只能是1,2,3,4,要把这些数值装进一个容量最大为4的容器里面,使得所用到这样的容器的个数最小. 经测试数据很大,会有10万个数据,所以这里我并不用排序数据,而是使用counting sort的思想,根据特定的数据优化,使得题解时间复杂度为O(n). 更多精彩内容:http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/ 程序如下: #include <iostream>

发送邮件报错:452 Too many recipients

发送邮件时提示:发送邮件时发生错误!452 Too many recipients 原因:根据国际标准允许100个收件人,如果一封邮件发送给多个收件人时,只允许100个,收件人超过100就会报这个错. 解决方法:设置---默认域服务器---服务器---smtp服务器 -只允许这些RCPT命令    后面的数字根据自己的需求定义 修改完成点击确定即可. 本文出自 "邮件服务器及网络管理笔记" 博客,请务必保留此出处http://19281928.blog.51cto.com/232719

CodeForces 233B Non-square Equation

链接: http://codeforces.com/problemset/problem/233/B 题目: B. Non-square Equation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Let's consider equation: x2+s(x)·x-n=0, where x,n are positive

CodeForces:200C: Football Championship

地址链接: CF:  http://codeforces.com/problemset/problem/200/C HUST Virtual Judge: http://acm.hust.edu.cn:8080/judge/problem/viewProblem.action?id=28923 题目: C. Football Championship time limit per test 2 seconds memory limit per test 256 megabytes input s

Codeforces Round #205 (Div. 2) / 353C Find Maximum (贪心)

Valera has array a, consisting of n integers a0,a1,...,an-1, and function f(x), taking an integer from 0 to 2n-1 as its single argument. Value f(x) is calculated by formula , where value bit(i) equals one if the binary representation of number xconta

Codeforces Round #201 (Div. 1) / 346A Alice and Bob:数论&amp;amp;想法题

A. Alice and Bob http://codeforces.com/problemset/problem/346/A time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It is so boring in the summer holiday, isn't it? So Alice and Bob have inven

算法:CodeForces #196(Div. 2) 337D Book of Evil(树形dp)

题意 给一棵n个结点的树,任意两个节点的距离是指连接两点的最短的边数 在树上的某个结点 有一个"恶魔之书",这本书会让距离它d以内的节点都受到影响 已知有m个节点收到了影响,问最多有几 个结点可能放着"恶魔之书"? 思路 要判断某个点是不是放着书,就要判断这个点的周围d距离以 内是否包含所有受影响的m节点 而如果某个节点距离最远的那个受影响节点的距离是L,如果L <= d,那 么说明所有受影响的m节点都在d以内,就可判断这个点可能放着书 那么,我们只要能够求出

Codeforces Round #100 / 140A:简单几何

http://codeforces.com/contest/140/problem/A 过大圆圆心作小圆切线即可发现规律,详见代码. 注意判相等一定要用fabs!!! 完整代码: /*30ms,0KB*/ #include<bits/stdc++.h> using namespace std; int main() { int n, R, r; double a; scanf("%d%d%d", &n, &R, &r); if (r > R |