String Palindrome

AtCoder

IDabc159_b

Time2000ms

Memory256MB

Difficulty—

A string $S$ of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: * $S$ is a palindrome. * Let $N$ be the length of $S$. The string formed by the $1$\-st through $((N-1)/2)$\-th characters of $S$ is a palindrome. * The string consisting of the $(N+3)/2$\-st through $N$\-th characters of $S$ is a palindrome. Determine whether $S$ is a strong palindrome. ## Constraints * $S$ consists of lowercase English letters. * The length of $S$ is an odd number between $3$ and $99$ (inclusive). ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

akasaka

Output #1

Yes

*   $S$ is `akasaka`.
*   The string formed by the $1$\-st through the $3$\-rd characters is `aka`.
*   The string formed by the $5$\-th through the $7$\-th characters is `aka`. All of these are palindromes, so $S$ is a strong palindrome.

Input #2

level

Output #2

No

Input #3

atcoder

Output #3

No

API Response (JSON)

{
  "problem": {
    "name": "String Palindrome",
    "description": {
      "content": "A string $S$ of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied: *   $S$ is a palindrome. *   Let $N$ be the length of $S$. The string f",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc159_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "A string $S$ of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied:\n\n*   $S$ is a palindrome.\n*   Let $N$ be the length of $S$. The string f...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments