結果
問題 | No.1406 Test |
ユーザー | McGregorsh |
提出日時 | 2023-05-06 14:28:21 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,503 bytes |
コンパイル時間 | 250 ms |
コンパイル使用メモリ | 82,024 KB |
実行使用メモリ | 89,656 KB |
最終ジャッジ日時 | 2024-05-03 02:04:12 |
合計ジャッジ時間 | 5,024 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 158 ms
89,308 KB |
testcase_01 | AC | 149 ms
88,980 KB |
testcase_02 | AC | 146 ms
89,512 KB |
testcase_03 | AC | 148 ms
89,256 KB |
testcase_04 | AC | 145 ms
89,548 KB |
testcase_05 | AC | 148 ms
89,576 KB |
testcase_06 | AC | 153 ms
89,352 KB |
testcase_07 | RE | - |
testcase_08 | AC | 147 ms
89,556 KB |
testcase_09 | RE | - |
testcase_10 | AC | 149 ms
89,356 KB |
testcase_11 | AC | 147 ms
89,292 KB |
testcase_12 | AC | 148 ms
89,448 KB |
testcase_13 | AC | 145 ms
89,604 KB |
testcase_14 | AC | 144 ms
89,632 KB |
testcase_15 | AC | 146 ms
89,584 KB |
testcase_16 | AC | 150 ms
89,308 KB |
testcase_17 | RE | - |
testcase_18 | AC | 147 ms
89,260 KB |
testcase_19 | AC | 143 ms
89,468 KB |
testcase_20 | RE | - |
testcase_21 | AC | 146 ms
89,244 KB |
testcase_22 | AC | 149 ms
89,492 KB |
testcase_23 | AC | 147 ms
89,596 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 main(): N = int(input()) A = i_list() suma = sum(A) ans = 0 for i in range(0, 101): if (suma+i) % N == 0: ans += 1 print(ans) if __name__ == '__main__': main()