{"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 them.\n\nNote that it is allowed to choose not to do the operation.\n\n## Constraints\n\n*   Each of $S$ and $T$ is a string of length between $2$ and $100$ (inclusive) consisting of lowercase English letters.\n*   $S$ and $T$ have the same length.\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":"abc221_b","tags":[],"sample_group":[["abc\nacb","Yes\n\nYou can swap the $2$\\-nd and $3$\\-rd characters of $S$ to make $S$ and $T$ equal."],["aabb\nbbaa","No\n\nThere is no way to do the operation to make $S$ and $T$ equal."],["abcde\nabcde","Yes\n\n$S$ and $T$ are already equal."]],"created_at":"2026-03-03 11:01:14"}}