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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<string>
#include<algorithm>
#include<deque>
using namespace std ; 
string sort(string ,string );
int main()
{
	int x ,y,j=0;
	string s ,t,c ;
	cin>>s>>t;
	x=s.length();
	y=t.length();
	if(s==t)
		cout<<"Yes";
	else 
	{
		if(x!=y)
		{
			cout<<"No";
			return 0; 
		}
		else if(x==y)
		{
			c=sort(s,t);
			if(c=="1")
			{
				deque<char>r;
				deque<char>r2;
				if(c=="1")
				{	
					for(int i=0;i<x;i++)
				{
					r[i]=s[i];
					r2[i]=t[i];
				}

				while (r!=r2)
				{
					r.push_front(r[x-1]);
					r.pop_back();
					j++;
					if(j=x)
					{
						cout<<"No";
						return 0 ;
					}
				}
				cout<<"Yes";
				}
			else if (c=="0")
			{
				cout<<"No";
				return 0;
			}

		
		}
	}
	
}
}
string sort (string a,string b )
{
	std::sort(a.begin(),a.end());
	std::sort (b.begin(),b.end());
	if(a==b)
		return "1";
	else
		return "0";
}