• Codeforces Round #185 (Div. 2) A. Whose sentence is it? 水题


    A. Whose sentence is it?

    Time Limit: 20 Sec

    Memory Limit: 256 MB

    题目连接

    http://codeforces.com/contest/312/problem/A

    Description

    One day, liouzhou_101 got a chat record of Freda and Rainbow. Out of curiosity, he wanted to know which sentences were said by Freda, and which were said by Rainbow. According to his experience, he thought that Freda always said "lala." at the end of her sentences, while Rainbow always said "miao." at the beginning of his sentences. For each sentence in the chat record, help liouzhou_101 find whose sentence it is.

    Input

    The first line of the input contains an integer n (1 ≤ n ≤ 10), number of sentences in the chat record. Each of the next n lines contains a sentence. A sentence is a string that contains only Latin letters (A-Z, a-z), underline (_), comma (,), point (.) and space ( ). Its length doesn’t exceed 100.

    Output

    For each sentence, output "Freda's" if the sentence was said by Freda, "Rainbow's" if the sentence was said by Rainbow, or "OMG>.< I don't know!" if liouzhou_101 can’t recognize whose sentence it is. He can’t recognize a sentence if it begins with "miao." and ends with "lala.", or satisfies neither of the conditions.

    Sample Input

    5
    I will go to play with you lala.
    wow, welcome.
    miao.lala.
    miao.
    miao .

    Sample Output

    Freda's
    OMG>.< I don't know!
    OMG>.< I don't know!
    Rainbow's
    OMG>.< I don't know!

    HINT

    题意

    给你一行字符串,如果前5个字符是miao.,那么这句话就是R说的

    如果最后五个字符时lala.,那么这句话就是F说的

    给你一个字符串,问你能否分辨出是谁说的呢?

    题解:

    水题啦,只用判断前五个和后五个字符啦

    代码:

    #include<iostream>
    #include<stdio.h>
    #include<math.h>
    using namespace std;
    
    string s;
    int main()
    {
        int n;
        scanf("%d",&n);getchar();
        for(int i=0;i<n;i++)
        {
            getline(cin,s);
            if(s.size()<5)
            {
                printf("OMG>.< I don't know!
    ");
                continue;
            }
            int flag1 = 0,flag2 = 0;
            int len = s.size();
            if(s[0]=='m'&&s[1]=='i'&&s[2]=='a'&&s[3]=='o'&&s[4]=='.')
                flag1 = 1;
            if(s[len-5]=='l'&&s[len-4]=='a'&&s[len-3]=='l'&&s[len-2]=='a'&&s[len-1]=='.')
                flag2 = 1;
            if(flag1==flag2)
                printf("OMG>.< I don't know!
    ");
            else if(flag1)
                printf("Rainbow's
    ");
            else if(flag2)
                printf("Freda's
    ");
        }
    }
  • 相关阅读:
    Android仿人人客户端(v5.7.1)——个人主页(三)
    hdu2554-N对数的排列问题
    POJ1363:Rails
    golang printf
    HDU1200:To and Fro
    [C# 基础知识系列]专题六:泛型基础篇——为什么引入泛型
    poj 2480 (欧拉函数应用)
    Re:从0开始的微服务架构--(二)快速快速体验微服务架构?--转
    爬虫推荐的工具
    python2 与 python3 语法区别--转
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4987467.html
Copyright © 2020-2023  润新知