Problem:
Score : 200 points

Problem Statement

You are given string S and T consisting of lowercase English letters.

Determine if S equals T after rotation.

That is, determine if S equals T after the following operation is performed some number of times:

Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.

Here, |X| denotes the length of the string X.

Constraints

2 \leq |S| \leq 100

|S| = |T|

S and T consist of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T

Output

If S equals T after rotation, print Yes; if it does not, print No.

Sample Input 1

kyoto
tokyo

Sample Output 1

Yes

In the first operation, kyoto becomes okyot.

In the second operation, okyot becomes tokyo.

Sample Input 2

abc
arc

Sample Output 2

No

abc does not equal arc after any number of operations.

Sample Input 3

aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab

Sample Output 3

Yes

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int main(){

int len=0,ans=0;
char S[101];
char T[101];
// fgets(S,sizeof(S),stdin);
scanf("%s",S);
scanf("%s",T);
for (int i = 0; i < 101; i++){
  len++;
  if (S[i]=='\0'){
    len--;
    break;
  }
}
int i = len-1;
while (i>=0)
{
  int k=0,match=0;
  for (int j = 0; j < len; j++){
    k = i+j;
    // if (k >= len){ k-=len;}
    if(T[j]==S[k]){
      match++;
    }else{
      break;
    }
  }
  if(match == len) ans=1;
  i--;
}

ans > 0 ? puts("Yes"):puts("No");

return 0;

}