typo

AtCoder

IDabc221_b

Time2000ms

Memory256MB

Difficulty—

You are given two strings $S$ and $T$. Determine whether it is possible to make $S$ and $T$ equal by doing the following operation **at most once**: * choose two adjacent characters in $S$ and swap them. Note that it is allowed to choose not to do the operation. ## Constraints * Each of $S$ and $T$ is a string of length between $2$ and $100$ (inclusive) consisting of lowercase English letters. * $S$ and $T$ have the same length. ## Input Input is given from Standard Input in the following format: $S$ $T$ [samples]

Samples

Input #1

abc
acb

Output #1

Yes

You can swap the $2$\-nd and $3$\-rd characters of $S$ to make $S$ and $T$ equal.

Input #2

aabb
bbaa

Output #2

No

There is no way to do the operation to make $S$ and $T$ equal.

Input #3

abcde
abcde

Output #3

Yes

$S$ and $T$ are already equal.

API Response (JSON)

{
  "problem": {
    "name": "typo",
    "description": {
      "content": "You are given two strings $S$ and $T$. Determine whether it is possible to make $S$ and $T$ equal by doing the following operation **at most once**: *   choose two adjacent characters in $S$ and swap",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc221_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given two strings $S$ and $T$. Determine whether it is possible to make $S$ and $T$ equal by doing the following operation **at most once**:\n\n*   choose two adjacent characters in $S$ and swap...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments