No.1217 Se Shi Su Se So
タグ : / 解いたユーザー数 515
作問者 :
anagohirame
/ テスター :
Problem Statement
You are given a string $S$, obtained from abcdefghijklmnopqrstuvwxyz by replacing one character with a different character.
If $S$ is abcdefghijklmnopqrstuvwxyz with X replaced by Y, output XtoY. See the samples for details.
Input
$S$
- $|S|=26$
- $S$ consists of lowercase English letters only
- The edit distance (Levenshtein distance) between $S$ and
abcdefghijklmnopqrstuvwxyzis 1 (that is, they differ in exactly one character)
Output
Output the answer in one line, in the format described in the problem statement. See also the samples.
Sample
Sample 1
Input
abcdefghijklmnopqrituvwxyz
Output
stoi
In abcdefghijklmnopqrstuvwxyz, s has been replaced by i.
Sample 2
Input
abcdefghujklmnopqrstuvwxyz
Output
itou
In abcdefghijklmnopqrstuvwxyz, i has been replaced by u.
Sample 3
Input
abcdefghijklmnnpqrstuvwxyz
Output
oton
In abcdefghijklmnopqrstuvwxyz, o has been replaced by n.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。