No.1335 1337
タグ : / 解いたユーザー数 396
作問者 :
copernicium0112
/ テスター :
Problem Statement
Each digit from $0~9$ is associated with one lowercase letter.
The correspondence is given by a string $A$ of $10$ letters, where digit $i$ corresponds to the character $A_i$.
Given a string $S$ consisting of lowercase letters and digits, convert it to letters according to the correspondence given by $A$,
and output the resulting string $T$.
Input
$A\\$ $S$
$|A|=10$
$1\le|S|\le100$
Output
$T$Print a newline at the end.
Sample
Sample 1
Input
olzeasbtgq h3110
Output
hello
3 is replaced with e, 1 with l, and 0 with o, so "hello" is obtained.
Sample 2
Input
olzeksblbq he170yu4ic0d3r
Output
helloyukicoder
The same letter may be assigned to different digits.
Sample 3
Input
oizeasbtgq 58353992
Output
sgeseqqz
Sample 4
Input
olzeasbtbq goodmorning
Output
goodmorning
There are cases where no replacement is needed.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。