{"problem":{"name":"String Rotation","description":{"content":"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc103_b"},"statements":[{"statement_type":"Markdown","content":"You are given string $S$ and $T$ consisting of lowercase English letters.\nDetermine if $S$ equals $T$ after _rotation_.\nThat is, determine if $S$ equals $T$ after the following operation is performed some number of times:\nOperation: Let $S = S_1 S_2 ... S_{|S|}$. Change $S$ to $S_{|S|} S_1 S_2 ... S_{|S|-1}$.\nHere, $|X|$ denotes the length of the string $X$.\n\n## Constraints\n\n*   $2 \\leq |S| \\leq 100$\n*   $|S| = |T|$\n*   $S$ and $T$ consist of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc103_b","tags":[],"sample_group":[["kyoto\ntokyo","Yes\n\n*   In the first operation, `kyoto` becomes `okyot`.\n*   In the second operation, `okyot` becomes `tokyo`."],["abc\narc","No\n\n`abc` does not equal `arc` after any number of operations."],["aaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab","Yes"]],"created_at":"2026-03-03 11:01:14"}}