String Rotation

AtCoder

IDabc103_b

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

kyoto
tokyo

Output #1

Yes

*   In the first operation, `kyoto` becomes `okyot`.
*   In the second operation, `okyot` becomes `tokyo`.

Input #2

abc
arc

Output #2

No

`abc` does not equal `arc` after any number of operations.

Input #3

aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab

Output #3

Yes

API Response (JSON)

{
  "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 ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments