Spring-1-A Post Robot(HDU 5007)解題報告及びテストデータ
5212 ワード
Post Robot
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K
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, ‘\r’ 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!
問題解:得意題はstring標準ライブラリ関数find(string str,int i)を用い,戻り値はiからstrが見つかるまでの最初の位置であるためpos-i=0を用いて現在の位置が一致するか否かを判断する.find()関数が一致する文字列が見つからない場合は-1を返します.
コードは次のとおりです.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K
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, ‘\r’ 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!
問題解:得意題はstring標準ライブラリ関数find(string str,int i)を用い,戻り値はiからstrが見つかるまでの最初の位置であるためpos-i=0を用いて現在の位置が一致するか否かを判断する.find()関数が一致する文字列が見つからない場合は-1を返します.
コードは次のとおりです.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
# include <iostream> # include <cstdio> # include <string> # include <cstring> # include <algorithm> # include <cctype> # include <sstream> # include <queue> using namespace std; #define F(i,s,e) for ( int i = s;i<e;i++) #define ss(x) scanf( "%d" ,&x) #define write() freopen( "1.in" , "r" ,stdin) #define W(x) while (x) string str[ 4 ]={ "iPod" , "iPad" , "iPhone" , "Apple" }; int main(){ //write(); string s; W(getline(cin,s)){ int len = s.length(); F(i, 0 ,len){ F(j, 0 , 4 ){ int pos = s.find(str[j],i); if (pos - i == 0 ){ cout << "MAI MAI MAI!" <<endl; break ; } } int pos = s.find( "Sony" ,i); if (pos - i == 0 )cout << "SONY DAFA IS GOOD!" <<endl; } } }