链接：
Aaah!
Jon Marius shouted too much at the recent Justin Bieber concert, and now needs to go to the doctor because of his sore throat. The doctor’s instructions are to say “aaah”. Unfortunately, the doctors sometimes need Jon Marius to say “aaah” for a while, which Jon Marius has never been good at. Each doctor requires a certain level of “aah” – some require “aaaaaah”, while others can actually diagnose his throat with just a “h”. (They often diagnose wrongly, but that is beyond the scope of this problem.) Since Jon Marius does not want to go to a doctor and have his time wasted, he wants to compare how long he manages to hold the “aaah” with the doctor’s requirements. (After all, who wants to be all like “aaah” when the doctor wants you to go “aaaaaah”?)
Each day Jon Marius calls up a different doctor and asks them how long his “aaah” has to be. Find out if Jon Marius would waste his time going to the given doctor.
Input
The input consists of two lines. The first line is the “aaah” Jon Marius is able to say that day. The second line is the “aah” the doctor wants to hear. Only lowercase ’a’ and ’h’ will be used in the input, and each line will contain between 0 and 999 ’a’s, inclusive, followed by a single ’h’.
Output
Output “go” if Jon Marius can go to that doctor, and output “no” otherwise.
Sample Input
aaah aaaaah
Sample Output
no
Source
题意：
算法：STL string 字符串查找
总结：
4294967295就是无符号位的整形最大值，也就是有符号位整形-1，也就是s.find(" ") == -1，结果就显而易见了。
所以 string s1,s2;
如果 s1中不包含 s2
令int ans = s1.find(s2)
则 ans = -1
或者说 ans = 4294967295
code：
#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
string s1,s2;
const int INF = 4294967295;
int main()
{
while(cin>>s1>>s2)
{
int ans = s1.find(s2);
if(ans != INF) printf("go\n");
else printf("no\n");
}
}#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
string s1,s2;
const int INF = 4294967295; //表示找不到
int main()
{
while(cin>>s1>>s2)
{
int ans = s1.find(s2);
if(ans == -1) printf("no\n");
else printf("go\n");
}
}#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
string s1,s2;
const int INF = 4294967295; //表示找不到
int main()
{
while(cin>>s1>>s2)
{
int ans = s1.find(s2);
if(ans >= 0)printf("go\n");
else printf("no\n");
}
}
334
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
