結果
問題 | No.593 4進FizzBuzz |
ユーザー | McGregorsh |
提出日時 | 2022-06-29 23:26:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,188 ms / 2,000 ms |
コード長 | 1,637 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 95,616 KB |
最終ジャッジ日時 | 2024-05-02 20:05:40 |
合計ジャッジ時間 | 24,884 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 119 ms
83,456 KB |
testcase_01 | AC | 119 ms
83,456 KB |
testcase_02 | AC | 122 ms
83,584 KB |
testcase_03 | AC | 121 ms
83,712 KB |
testcase_04 | AC | 119 ms
83,200 KB |
testcase_05 | AC | 127 ms
83,200 KB |
testcase_06 | AC | 121 ms
83,456 KB |
testcase_07 | AC | 121 ms
83,072 KB |
testcase_08 | AC | 119 ms
83,584 KB |
testcase_09 | AC | 118 ms
83,712 KB |
testcase_10 | AC | 119 ms
83,584 KB |
testcase_11 | AC | 120 ms
83,712 KB |
testcase_12 | AC | 124 ms
83,584 KB |
testcase_13 | AC | 127 ms
83,584 KB |
testcase_14 | AC | 118 ms
83,584 KB |
testcase_15 | AC | 122 ms
83,584 KB |
testcase_16 | AC | 1,026 ms
93,312 KB |
testcase_17 | AC | 1,172 ms
93,568 KB |
testcase_18 | AC | 1,028 ms
93,568 KB |
testcase_19 | AC | 1,033 ms
95,360 KB |
testcase_20 | AC | 1,073 ms
93,568 KB |
testcase_21 | AC | 1,109 ms
93,696 KB |
testcase_22 | AC | 1,071 ms
95,488 KB |
testcase_23 | AC | 1,049 ms
93,568 KB |
testcase_24 | AC | 1,188 ms
93,440 KB |
testcase_25 | AC | 1,055 ms
93,312 KB |
testcase_26 | AC | 1,022 ms
95,616 KB |
testcase_27 | AC | 1,008 ms
95,232 KB |
testcase_28 | AC | 1,015 ms
93,056 KB |
testcase_29 | AC | 1,023 ms
95,616 KB |
testcase_30 | AC | 1,026 ms
93,056 KB |
testcase_31 | AC | 1,035 ms
93,568 KB |
testcase_32 | AC | 1,038 ms
93,568 KB |
testcase_33 | AC | 1,057 ms
95,488 KB |
testcase_34 | AC | 1,015 ms
93,312 KB |
ソースコード
import sys, re 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 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(): n = input() score = 0 for i in range(len(n)): score += pow(4, (len(n)-i-1), 15) * int(n[i]) if score % 3 == 0 and score % 5 == 0: print('FizzBuzz') elif score % 3 == 0 and score % 5 != 0: print('Fizz') elif score % 3 != 0 and score % 5 == 0: print('Buzz') else: print(n) if __name__ == '__main__': main()