問題一覧 > 通常問題

No.1217 Se Shi Su Se So

レベル : / AI推定難易度 : 104 / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 512 MB / 標準ジャッジ問題
タグ : (AC するまで非表示) / 解いたユーザー数 515
作問者 : anagohirame / テスター : first_vil
お気に入りにしたユーザー ProblemId : 4734 / 自分の提出
問題文最終更新日: 2020-08-31 01:42:33
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence. Back to the original
yukicoder contest 264 (順位表) の他の問題:

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 abcdefghijklmnopqrstuvwxyz is 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もしくは右上の雲マークをクリックしてアカウントを作成してください。