1163: affinity string (string)

1163: Affinity string （ character string ）

Title Description
Judge affinity string . The definition of affinity string is like this ： Given two strings s1 and s2, If you can pass s1 Cyclic shift , send s2 Included in s1 in , So let's say s2 yes s1 Affinity string of .
Input
There are many sets of test data , The first line of each set of data contains the input string s1, The second line contains the input string s2,s1 And s2 The length of each of them is less than 100000.
Output
If s2 yes s1 Affinity string of , The output "yes", conversely , Output "no". The output of each test takes up one line .
The sample input Copy
AABCD
CDAA
ASD
ASDF
ab
aba
Sample output Copy
yes
no
no
source / classification

#include<stdio.h>
#include<string.h>
#define N 200000
/*  Judge affinity string  s1 Cyclic shift s2 Included in s1 in   Just put the s1 Change to two consecutive s1, Then judge directly  strstr(str1,str2)  Function is used to determine the string str2 Whether it is str1 The string of .  If it is , Then the function returns str2 stay str1 The address that first appeared in ; otherwise , return NULL. */
int main(){
    
    char s1[N],s2[N],s3[N];
    while(scanf("%s%s",&s1,&s2)!=EOF){
    
        if(strlen(s1)<strlen(s2)){
    
            printf("no\n");
        }
        else{
    
            strcpy(s3,s1);// take s1 The contents of are saved in s3
            strcat(s1,s3);// take s3 The content of is followed by s1 Behind 
            if(strstr(s1,s2)!=NULL){
    
                printf("yes\n");// Judgment string s2 Whether it is s1 The string of 
            }
            else {
    
                printf("no\n");
            }
        }
    }
    return 0;
}