結果
問題 | No.593 4進FizzBuzz |
ユーザー | McGregorsh |
提出日時 | 2022-06-29 23:17:50 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,622 bytes |
コンパイル時間 | 231 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 348,288 KB |
最終ジャッジ日時 | 2024-11-23 14:01:33 |
合計ジャッジ時間 | 62,860 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 130 ms
88,448 KB |
testcase_01 | AC | 135 ms
347,392 KB |
testcase_02 | AC | 133 ms
88,704 KB |
testcase_03 | AC | 134 ms
347,008 KB |
testcase_04 | AC | 134 ms
88,832 KB |
testcase_05 | AC | 135 ms
347,904 KB |
testcase_06 | AC | 136 ms
88,704 KB |
testcase_07 | AC | 136 ms
347,008 KB |
testcase_08 | AC | 137 ms
88,704 KB |
testcase_09 | AC | 137 ms
348,288 KB |
testcase_10 | AC | 137 ms
88,704 KB |
testcase_11 | AC | 136 ms
347,520 KB |
testcase_12 | AC | 136 ms
88,576 KB |
testcase_13 | AC | 136 ms
347,648 KB |
testcase_14 | AC | 137 ms
88,192 KB |
testcase_15 | AC | 138 ms
347,136 KB |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | TLE | - |
ソースコード
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 += 4 ** (len(n)-i-1) * 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()