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 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main(void)
{
	char s[101]={0};
	char t[101]={0};
	int slen=0,tlen=0;
	int i=0,j=0;  //循环控制变量 
	char temp; 
	gets(s);
	gets(t);
	slen=strlen(s);
	tlen=strlen(t);
	if(strcmp(s,t)==0)
	{
		printf("Yes");
		return 0;
	 } 
	 
	for(i=0;i<slen;i++)
	{
		temp=s[slen-1];
		for(j=slen-1;j>0;j--)
		{
			s[j]=s[j-1];
		} 
		 s[0]=temp;
		 if(strcmp(s,t)==0)
		 {
		printf("Yes");
		return 0;
	 	 } 
	}
	
	printf("No");
	system("pause");
	return 0;
}