Canadian Computing Competition: 2020 Stage 1, Junior #4
Thuc likes finding cyclic shifts of strings. A cyclic shift of a string is obtained by moving characters from the beginning of the string to the end of the string. We also consider a string to be a cyclic shift of itself. For example, the cyclic shifts of
Given some text, , and a string, , determine if contains a cyclic shift of .
The input will consist of exactly two lines containing only uppercase letters. The first line will be the text , and the second line will be the string . Each line will contain at most characters.
For of the available marks, will be exactly characters in length.
yes if the text, , contains a cyclic shift of the string, . Otherwise, output
Sample Input 1
Output for Sample Input 1
Explanation of Output for Sample Input 1
CDEAB is a cyclic shift of
ABCDE and is contained in the text
Sample Input 2
Output for Sample Input 2
Explanation of Output for Sample Input 2
The cyclic shifts of
AAB. None of these shifts are contained in the text