J4. Cyclic Shifts
레이팅 미적용의견: 0
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
ABCDE are:
ABCDE, BCDEA,
CDEAB, DEABC, and
EABCD.
Given some text, \(T\), and a
string, \(S\), determine if \(T\) contains a cyclic shift of \(S\).
The input will consist of exactly two lines containing only uppercase
letters. The first line will be the text \(T\), and the second line will be the string
\(S\). Each line will contain at most
\(1000\) characters.
For 6 of the 15 available marks, \(S\) will be exactly \(3\) characters in length.
Output yes if the text, \(T\), contains a cyclic shift of the string,
\(S\). Otherwise, output
no.
ABCCDEABAA
ABCDEyesCDEAB is a cyclic shift of
ABCDE and it is contained in the text
ABCCDEABAA.
ABCDDEBCAB
ABAnoThe cyclic shifts of ABA are
ABA, BAA, and
AAB. None of these shifts are contained in the
text ABCDDEBCAB.
평가 및 의견
J4. Cyclic Shifts
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
J4. Cyclic Shifts