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

    Post Robot

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


    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
     
     
     
    解析:字符串水题,简单粗暴直接过~~
     
     
     
     1 #include <cstdio>
     2 #include <cstring>
     3 
     4 char s[8200];
     5 
     6 int main()
     7 {
     8     while(~scanf("%s",s)){
     9         int len = strlen(s);
    10         for(int i = 0; i<len; ){
    11             if(i+4<len){
    12                 if(s[i] == 'A' && s[i+1] == 'p' && s[i+2] == 'p'&& s[i+3] == 'l' && s[i+4] == 'e'){
    13                     printf("MAI MAI MAI!
    ");
    14                     i += 5;
    15                     continue;
    16                 }
    17             }
    18             if(i+5<len){
    19                 if(s[i] == 'i' && s[i+1] == 'P' && s[i+2] == 'h'&& s[i+3] == 'o' && s[i+4] == 'n' && s[i+5] == 'e'){
    20                     printf("MAI MAI MAI!
    ");
    21                     i += 6;
    22                     continue;
    23                 }
    24             }
    25             if(i+3<len){
    26                 if(s[i] == 'i' && s[i+1] == 'P' && s[i+2] == 'o'&& s[i+3] == 'd'){
    27                     printf("MAI MAI MAI!
    ");
    28                     i += 4;
    29                     continue;
    30                 }
    31                 if(s[i] == 'i' && s[i+1] == 'P' && s[i+2] == 'a'&& s[i+3] == 'd'){
    32                     printf("MAI MAI MAI!
    ");
    33                     i += 4;
    34                     continue;
    35                 }
    36                 if(s[i] == 'S' && s[i+1] == 'o' && s[i+2] == 'n'&& s[i+3] == 'y'){
    37                     printf("SONY DAFA IS GOOD!
    ");
    38                     i += 4;
    39                     continue;
    40                 }
    41             }
    42             ++i;
    43         }
    44     }
    45     return 0;
    46 }
  • 相关阅读:
    BZOJ5368:[PKUSC2018]真实排名(组合数学)
    【HDU2222】Keywords Search
    KMP算法
    【BZOJ3262】 陌上花开
    【POJ2104】kth num
    【BZOJ1251】序列终结者
    【BZOJ3524】 [Poi2014]Couriers
    【BZOJ2049】 [Sdoi2008]Cave 洞穴勘测
    【BZOJ1468】Tree
    【BZOJ2152】聪聪可可
  • 原文地址:https://www.cnblogs.com/inmoonlight/p/5172275.html
Copyright © 2011-2022 走看看