結果

問題 No.637 X: Yet Another FizzBuzz Problem
ユーザー McGregorshMcGregorsh
提出日時 2023-04-04 21:17:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 143 ms / 1,000 ms
コード長 1,638 bytes
コンパイル時間 185 ms
コンパイル使用メモリ 82,228 KB
実行使用メモリ 89,840 KB
最終ジャッジ日時 2024-10-01 11:27:02
合計ジャッジ時間 5,646 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 132 ms
89,332 KB
testcase_01 AC 138 ms
89,504 KB
testcase_02 AC 136 ms
89,332 KB
testcase_03 AC 135 ms
89,516 KB
testcase_04 AC 128 ms
89,388 KB
testcase_05 AC 133 ms
89,572 KB
testcase_06 AC 135 ms
89,040 KB
testcase_07 AC 143 ms
89,608 KB
testcase_08 AC 142 ms
89,656 KB
testcase_09 AC 140 ms
89,680 KB
testcase_10 AC 131 ms
89,568 KB
testcase_11 AC 136 ms
89,444 KB
testcase_12 AC 134 ms
89,168 KB
testcase_13 AC 138 ms
89,552 KB
testcase_14 AC 137 ms
89,484 KB
testcase_15 AC 141 ms
89,812 KB
testcase_16 AC 133 ms
89,560 KB
testcase_17 AC 139 ms
89,456 KB
testcase_18 AC 139 ms
89,436 KB
testcase_19 AC 134 ms
89,460 KB
testcase_20 AC 135 ms
89,776 KB
testcase_21 AC 140 ms
89,680 KB
testcase_22 AC 141 ms
89,468 KB
testcase_23 AC 139 ms
89,156 KB
testcase_24 AC 130 ms
89,840 KB
testcase_25 AC 133 ms
89,672 KB
testcase_26 AC 138 ms
89,064 KB
testcase_27 AC 136 ms
89,620 KB
testcase_28 AC 136 ms
89,608 KB
testcase_29 AC 133 ms
89,356 KB
testcase_30 AC 133 ms
89,460 KB
testcase_31 AC 132 ms
89,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 = i_list()
ans = 0
for i in range(5):
if A[i] % 3 == 0 and A[i] % 5 == 0:
ans += 8
elif A[i] % 3 == 0 and A[i] % 5 != 0:
ans += 4
elif A[i] % 3 != 0 and A[i] % 5 == 0:
ans += 4
else:
ans += len(str(A[i]))
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0