結果

問題 No.944 煎っぞ!
ユーザー McGregorshMcGregorsh
提出日時 2022-07-06 15:39:12
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,305 bytes
コンパイル時間 163 ms
コンパイル使用メモリ 82,020 KB
実行使用メモリ 101,772 KB
最終ジャッジ日時 2024-06-01 11:19:11
合計ジャッジ時間 6,661 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 155 ms
101,404 KB
testcase_02 AC 160 ms
101,360 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 156 ms
100,896 KB
testcase_06 AC 152 ms
101,472 KB
testcase_07 AC 155 ms
101,208 KB
testcase_08 WA -
testcase_09 AC 157 ms
101,356 KB
testcase_10 AC 143 ms
89,416 KB
testcase_11 AC 142 ms
89,524 KB
testcase_12 AC 137 ms
89,456 KB
testcase_13 AC 123 ms
83,324 KB
testcase_14 AC 143 ms
89,852 KB
testcase_15 AC 141 ms
89,548 KB
testcase_16 AC 123 ms
83,220 KB
testcase_17 AC 122 ms
83,372 KB
testcase_18 AC 141 ms
89,796 KB
testcase_19 AC 142 ms
89,600 KB
testcase_20 AC 158 ms
101,684 KB
testcase_21 AC 156 ms
101,744 KB
testcase_22 AC 154 ms
101,244 KB
testcase_23 AC 158 ms
101,480 KB
testcase_24 AC 156 ms
101,136 KB
testcase_25 AC 154 ms
101,284 KB
testcase_26 AC 159 ms
101,564 KB
testcase_27 AC 166 ms
101,580 KB
testcase_28 AC 127 ms
83,348 KB
testcase_29 WA -
testcase_30 AC 157 ms
101,464 KB
testcase_31 AC 203 ms
101,588 KB
testcase_32 AC 162 ms
101,396 KB
testcase_33 AC 170 ms
101,636 KB
testcase_34 AC 160 ms
101,420 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

###約数列挙###

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()

0