結果
問題 | No.944 煎っぞ! |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 15:39:12 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,305 bytes |
コンパイル時間 | 623 ms |
コンパイル使用メモリ | 86,732 KB |
実行使用メモリ | 107,804 KB |
最終ジャッジ日時 | 2023-08-23 13:45:35 |
合計ジャッジ時間 | 11,823 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 254 ms
105,840 KB |
testcase_02 | AC | 256 ms
105,596 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 254 ms
105,888 KB |
testcase_06 | AC | 256 ms
105,680 KB |
testcase_07 | AC | 256 ms
105,992 KB |
testcase_08 | WA | - |
testcase_09 | AC | 254 ms
105,664 KB |
testcase_10 | AC | 240 ms
93,468 KB |
testcase_11 | AC | 240 ms
94,108 KB |
testcase_12 | AC | 237 ms
93,456 KB |
testcase_13 | AC | 233 ms
92,696 KB |
testcase_14 | AC | 238 ms
94,052 KB |
testcase_15 | AC | 236 ms
93,364 KB |
testcase_16 | AC | 232 ms
92,636 KB |
testcase_17 | AC | 239 ms
92,632 KB |
testcase_18 | AC | 240 ms
93,968 KB |
testcase_19 | AC | 242 ms
93,824 KB |
testcase_20 | AC | 255 ms
106,336 KB |
testcase_21 | AC | 257 ms
106,176 KB |
testcase_22 | AC | 254 ms
105,760 KB |
testcase_23 | AC | 253 ms
105,672 KB |
testcase_24 | AC | 254 ms
105,620 KB |
testcase_25 | AC | 253 ms
105,892 KB |
testcase_26 | AC | 251 ms
105,576 KB |
testcase_27 | AC | 263 ms
106,008 KB |
testcase_28 | AC | 236 ms
92,564 KB |
testcase_29 | WA | - |
testcase_30 | AC | 257 ms
106,308 KB |
testcase_31 | AC | 310 ms
107,568 KB |
testcase_32 | AC | 260 ms
105,876 KB |
testcase_33 | AC | 268 ms
107,804 KB |
testcase_34 | AC | 261 ms
106,096 KB |
ソースコード
###約数列挙### def make_divisors(n): lower_divisors, upper_divisors = [], [] i = 1 while i * i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] ###順列### def nPr(n, r): npr = 1 for i in range(n, n-r, -1): npr *= i return npr ###組合せ### def nCr(n, r): factr = 1 r = min(r, n - r) for i in range(r, 1, -1): factr *= i return nPr(n, r)/factr 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 = int(input()) A = i_list() sum_a = sum(A) nums = make_divisors(sum_a) nums.sort() #print(nums) ans = 0 for i in range(len(nums)): now = nums[i] cou = 0 score = 0 for j in range(n): cou += A[j] #print(cou, i) if cou == now: score += 1 cou = 0 if cou > now: break ans = max(ans, score) print(ans) if __name__ == '__main__': main()