結果
問題 | No.1335 1337 |
ユーザー | McGregorsh |
提出日時 | 2023-05-04 13:07:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 146 ms / 2,000 ms |
コード長 | 1,507 bytes |
コンパイル時間 | 427 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 89,628 KB |
最終ジャッジ日時 | 2024-05-01 22:48:52 |
合計ジャッジ時間 | 3,718 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
89,252 KB |
testcase_01 | AC | 146 ms
89,600 KB |
testcase_02 | AC | 141 ms
89,056 KB |
testcase_03 | AC | 140 ms
89,628 KB |
testcase_04 | AC | 140 ms
89,584 KB |
testcase_05 | AC | 139 ms
89,380 KB |
testcase_06 | AC | 141 ms
89,600 KB |
testcase_07 | AC | 141 ms
89,244 KB |
testcase_08 | AC | 141 ms
89,528 KB |
testcase_09 | AC | 141 ms
89,300 KB |
testcase_10 | AC | 141 ms
89,620 KB |
testcase_11 | AC | 141 ms
89,228 KB |
testcase_12 | AC | 143 ms
89,248 KB |
testcase_13 | AC | 142 ms
89,492 KB |
testcase_14 | AC | 140 ms
89,476 KB |
testcase_15 | AC | 140 ms
89,448 KB |
testcase_16 | AC | 138 ms
89,172 KB |
testcase_17 | AC | 137 ms
89,516 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): A = input() S = list(input()) nu = '0123456789' for i in range(len(S)): if S[i] in nu: S[i] = A[int(S[i])] print(''.join(S)) if __name__ == '__main__': main()