Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Ring

Write a program which finds a pattern $p$ in a ring shaped text $s$.

Input

In the first line, the text $s$ is given.

In the second line, the pattern $p$ is given.

Output

If $p$ is in $s$, print Yes in a line, otherwise No.

Constraints

$1 \leq $ length of $p \leq $ length of $s \leq 100$

$s$ and $p$ consists of lower-case letters

Sample Input 1

vanceknowledgetoad
advance

Sample Output 1

Yes

Sample Input 2

vanceknowledgetoad
advanced

Sample Output 2

No

Solution in JAVA (judge verdict: Accepted)

import java.util.*;
class Main {
    public static void main(String...args) {
        boolean isCollect = false;
        int count = 0;
        Scanner scan = new Scanner(System.in);
        String ring = scan.nextLine();
        String str = scan.nextLine();
        char[] chrs = ring.toCharArray();
        List<Character> ringList = new ArrayList<>();
        for(int k = 0 ; k < 2; k++) {
            for(char c :chrs) {
                ringList.add(new Character(c));
            }
        }
        for(int i = 0; i < ring.length(); i++) {
            for(int j = 0; j <str.length(); j++) {
                if(ringList.get(i + j) != str.charAt(j)) {
                    count = 0;
                    for(int k = 0 ; k < 2; k++) {
                        for(char c :chrs) {
                            ringList.add(new Character(c));
                        }
                    }   
                    break;
                }
                else {
                    //Character replace = ringList.get(0);
                    count++;
                    //ringList.add(replace);
                }
            }
            if(count == str.length()) {
                isCollect = true;
            } 
        }
        if(isCollect) {
            System.out.println("Yes");
        }
        else {
            System.out.println("No");
        }
    }
}