結果
問題 | No.1729 ~サンプルはちゃんと見て!~ 16進数と8進数(1) |
ユーザー | McGregorsh |
提出日時 | 2023-05-24 21:43:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 140 ms / 2,000 ms |
コード長 | 1,847 bytes |
コンパイル時間 | 385 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 89,728 KB |
最終ジャッジ日時 | 2024-06-06 08:16:22 |
合計ジャッジ時間 | 4,418 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 140 ms
89,300 KB |
testcase_01 | AC | 135 ms
89,472 KB |
testcase_02 | AC | 139 ms
89,472 KB |
testcase_03 | AC | 135 ms
89,216 KB |
testcase_04 | AC | 138 ms
89,340 KB |
testcase_05 | AC | 136 ms
89,472 KB |
testcase_06 | AC | 140 ms
89,600 KB |
testcase_07 | AC | 136 ms
89,148 KB |
testcase_08 | AC | 136 ms
89,216 KB |
testcase_09 | AC | 135 ms
89,728 KB |
testcase_10 | AC | 134 ms
89,696 KB |
testcase_11 | AC | 137 ms
89,344 KB |
testcase_12 | AC | 136 ms
89,088 KB |
testcase_13 | AC | 135 ms
89,600 KB |
testcase_14 | AC | 135 ms
89,216 KB |
testcase_15 | AC | 134 ms
89,404 KB |
testcase_16 | AC | 135 ms
89,344 KB |
testcase_17 | AC | 133 ms
89,600 KB |
testcase_18 | AC | 134 ms
89,556 KB |
testcase_19 | AC | 134 ms
89,660 KB |
testcase_20 | AC | 139 ms
89,472 KB |
testcase_21 | AC | 140 ms
89,216 KB |
testcase_22 | AC | 132 ms
89,728 KB |
testcase_23 | AC | 131 ms
89,216 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, lru_cache 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' #input = sys.stdin.readline def main(): S = input() num = int(S, 16) num = oct(num)[2:] C = Counter(list(num)) ans = [] maxnum = 0 for key, value in C.items(): ans.append([value, key]) maxnum = max(maxnum, value) ans.sort(reverse=True) base = [] for i in range(len(ans)): if ans[i][0] == maxnum: base.append(ans[i][1]) base.sort() print(*base) if __name__ == '__main__': main()