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 <cstring>
#include <cstdio>
using namespace std;
char a[110],b[110];
int main()
{
    scanf("%s",a);
    scanf("%s",b);
    int lena = strlen(a),m,n;
    bool e = true;
    for(int i = 0; i != lena; ++i)
    {
        m = lena - i;//a第i个至结尾
        //n = lenb - m;//b剩下的
        n = 0;
        e = true;
        for(int j = i; j != lena; ++j)
        {
            if(a[j] != b[n++]){
                e = false;
                break;
            }
        }
        if(e)
        {
            n = m;
            for(int j = 0; j != m-1;++j)
            {
                if(a[j] != b[n++])
                    e = false;
            }
        }
        if(e)
        {
            break;
        }

    }
    if(e)
    {
        printf("Yes\n");
    }
    else
        printf("No\n");
    return 0;
}