zoukankan      html  css  js  c++  java
  • hdu5007 Post Robot

    Post Robot

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 1924    Accepted Submission(s): 1362


    Problem Description
    DT is a big fan of digital products. He writes posts about technological products almost everyday in his blog.

    But there is such few comments of his posts that he feels depressed all the day. As his best friend and an excellent programmer, DT asked you to help make his blog look more popular. He is so warm that you have no idea how to refuse. But you are unwilling to read all of his boring posts word by word. So you decided to write a script to comment below his posts automatically.

    After observation, you found words “Apple” appear everywhere in his posts. After your counting, you concluded that “Apple”, “iPhone”, “iPod”, “iPad” are the most high-frequency words in his blog. Once one of these words were read by your smart script, it will make a comment “MAI MAI MAI!”, and go on reading the post. 

    In order to make it more funny, you, as a fan of Sony, also want to make some comments about Sony. So you want to add a new rule to the script: make a comment “SONY DAFA IS GOOD!” when “Sony” appears.
     

    Input
    A blog article described above, which contains only printable characters(whose ASCII code is between 32 and 127), CR(ASCII code 13, ‘ ’ in C/C++), LF(ASCII code 10, ‘ ’ in C/C++), please process input until EOF. Note all characters are case sensitive.

    The size of the article does not exceed 8KB.
     

    Output
    Output should contains comments generated by your script, one per line.
     

    Sample Input
    Apple bananaiPad lemon ApplepiSony 233 Tim cook is doubi from Apple iPhoneipad iPhone30 is so biiiiiiig Microsoft makes good App.
     

    Sample Output
    MAI MAI MAI! MAI MAI MAI! MAI MAI MAI! SONY DAFA IS GOOD! MAI MAI MAI! MAI MAI MAI! MAI MAI MAI!
     

    Source
     

    Recommend

    hujie



    记住这种方法即可

    #include<stdio.h>
    #include<string.h>
    #include<stdlib.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    char s[1000];
    int main()
    {
        while(~scanf("%s",s))
        {
            string str;
            int len=strlen(s);
            for(int i=0; i<len; i++)
            {
                if(s[i]=='A')
                {
                    str="";
                    for(int j=i; j<i+5; j++)
                        str+=s[j];
                    if(str=="Apple")
                        printf("MAI MAI MAI!
    ");
                }
                else if(s[i]=='i')
                {
                    str="";
                    for(int j=i; j<i+4; j++)
                        str+=s[j];
                    if(str=="iPod")
                        printf("MAI MAI MAI!
    ");
                    str="";
                    for(int j=i; j<i+6; j++)
                        str+=s[j];
                    if(str=="iPhone")
                        printf("MAI MAI MAI!
    ");
                    str="";
                    for(int j=i; j<i+4; j++)
                        str+=s[j];
                    if(str=="iPad")
                        printf("MAI MAI MAI!
    ");
                }
                else if(s[i]=='S')
                {
                    str="";
                    for(int j=i; j<i+4; j++)
                        str+=s[j];
                    if(str=="Sony")
                        printf("SONY DAFA IS GOOD!
    ");
                }
            }
        }
        return 0;
    }


  • 相关阅读:
    BZOJ3149 CTSC2013 复原 搜索
    BZOJ5016 SNOI2017 一个简单的询问 莫队、前缀和、容斥
    THUWC2019-1:Reach out
    Luogu4630 APIO2018 Duathlon 圆方树、树形DP
    Luogu4606 SDOI2018 战略游戏 圆方树、虚树、链并
    BZOJ3720 Gty的妹子树 询问分块、主席树
    CF809E Surprise me! 莫比乌斯反演、虚树
    LOJ2542 PKUWC2018 随机游走 min-max容斥、树上高斯消元、高维前缀和、期望
    LOJ2541 PKUWC2018 猎人杀 期望、容斥、生成函数、分治FFT
    CF797F Mice and Holes 贪心、栈维护DP
  • 原文地址:https://www.cnblogs.com/zxy160/p/7215121.html
Copyright © 2011-2022 走看看