zoukankan      html  css  js  c++  java
  • 【HDU 5007】Post Robot

    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!
    题意:每行中有“Apple”, “iPhone”, “iPod”, “iPad” 出现则,输出MAI MAI MAI!,有Sony出现,输出SONY DAFA IS GOOD!
    分析:读入用字符串读,然后用strstr函数,strstr(str1,str2)返回字符串str2在str1第一次出现的指针
    #include<stdio.h>
    #include<string.h>
    char str[10240],ch[10][10]={"Apple", "iPhone", "iPod", "iPad" ,"Sony"};
    int main(){
        while(~scanf("%s",str)){
            for(int i=0;i<4;i++)
                if(strstr(str,ch[i])-str>=0)
                    printf("MAI MAI MAI!
    ");
            if(strstr(str,ch[4])-str>=0)
                printf("SONY DAFA IS GOOD!
    ");
        }
        return 0;
    }
  • 相关阅读:
    騎士宣言
    [洛谷P1631] 序列合并
    [HNOI2006]公路修建问题
    [洛谷2068] 统计和
    [洛谷P1168] 中位数
    【模板】可持久化数组(可持久化线段树/平衡树)
    【模板】可持久化线段树 1(主席树)
    [JSOI2008]最大数maxnumber
    NOI导刊2010提高(06) 黑匣子
    [洛谷1533] 可怜的狗狗
  • 原文地址:https://www.cnblogs.com/flipped/p/5183534.html
Copyright © 2011-2022 走看看