kmp裸题。。。
#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
using namespace std;
int next[200005];
void nextstr(string s)
{
int m=s.length();
next[0]=0,next[1]=0;
for(int i=1;i<m;i++)
{
int j=next[i];
while(j&&s[i]!=s[j])
j=next[j];
if(s[i]==s[j])
next[i+1]=j+1;
else
next[i+1]=0;
}
}
int KMP(string s1,string s2)
{ int i,j;
int m=s2.length();
for(i=0;i<s1.length();i++)
{
while(j&&s1[i]!=s2[j])
j=next[j];
if(s1[i]==s2[j])
j++;
if(j==m)
return 1;
}
return 0;
}
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
string s1,s2;
while(cin>>s1>>s2){
s1=s1+s1;
nextstr(s2);
// for(int i=0;i<s2.length();i++)
// printf("%d ",next[i]);
if(KMP(s1,s2))
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
return 0;
}