結果
問題 | No.327 アルファベット列 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 22:29:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 255 ms / 2,000 ms |
コード長 | 1,585 bytes |
コンパイル時間 | 1,257 ms |
コンパイル使用メモリ | 86,700 KB |
実行使用メモリ | 92,432 KB |
最終ジャッジ日時 | 2023-08-20 21:27:42 |
合計ジャッジ時間 | 16,462 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
92,324 KB |
testcase_01 | AC | 250 ms
92,008 KB |
testcase_02 | AC | 249 ms
92,336 KB |
testcase_03 | AC | 247 ms
92,224 KB |
testcase_04 | AC | 251 ms
92,164 KB |
testcase_05 | AC | 248 ms
92,280 KB |
testcase_06 | AC | 251 ms
92,276 KB |
testcase_07 | AC | 251 ms
92,432 KB |
testcase_08 | AC | 249 ms
92,164 KB |
testcase_09 | AC | 246 ms
92,400 KB |
testcase_10 | AC | 248 ms
92,404 KB |
testcase_11 | AC | 249 ms
92,360 KB |
testcase_12 | AC | 251 ms
92,356 KB |
testcase_13 | AC | 251 ms
92,188 KB |
testcase_14 | AC | 250 ms
92,312 KB |
testcase_15 | AC | 250 ms
92,312 KB |
testcase_16 | AC | 250 ms
92,236 KB |
testcase_17 | AC | 252 ms
92,308 KB |
testcase_18 | AC | 249 ms
92,320 KB |
testcase_19 | AC | 244 ms
92,176 KB |
testcase_20 | AC | 244 ms
92,228 KB |
testcase_21 | AC | 244 ms
92,264 KB |
testcase_22 | AC | 252 ms
92,312 KB |
testcase_23 | AC | 249 ms
91,960 KB |
testcase_24 | AC | 249 ms
92,344 KB |
testcase_25 | AC | 242 ms
92,312 KB |
testcase_26 | AC | 246 ms
92,008 KB |
testcase_27 | AC | 248 ms
92,332 KB |
testcase_28 | AC | 250 ms
92,316 KB |
testcase_29 | AC | 249 ms
92,344 KB |
testcase_30 | AC | 255 ms
92,196 KB |
testcase_31 | AC | 248 ms
92,080 KB |
testcase_32 | AC | 245 ms
92,040 KB |
testcase_33 | AC | 247 ms
92,268 KB |
testcase_34 | AC | 247 ms
92,188 KB |
testcase_35 | AC | 249 ms
92,228 KB |
testcase_36 | AC | 246 ms
92,320 KB |
testcase_37 | AC | 247 ms
92,192 KB |
testcase_38 | AC | 248 ms
92,212 KB |
testcase_39 | AC | 248 ms
92,052 KB |
testcase_40 | AC | 246 ms
92,212 KB |
testcase_41 | AC | 248 ms
92,260 KB |
testcase_42 | AC | 248 ms
92,268 KB |
testcase_43 | AC | 246 ms
92,176 KB |
testcase_44 | AC | 250 ms
92,184 KB |
testcase_45 | AC | 248 ms
92,192 KB |
testcase_46 | AC | 249 ms
92,084 KB |
testcase_47 | AC | 245 ms
92,204 KB |
testcase_48 | AC | 249 ms
92,272 KB |
testcase_49 | AC | 251 ms
92,088 KB |
testcase_50 | AC | 254 ms
92,160 KB |
testcase_51 | AC | 253 ms
92,184 KB |
testcase_52 | AC | 254 ms
92,168 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 num2alpha(num): if num<=26: return chr(64+num) elif num%26==0: return num2alpha(num//26-1)+chr(90) else: return num2alpha(num//26)+chr(64+num%26) def main(): N = int(input()) + 1 print(num2alpha(N)) if __name__ == '__main__': main()