結果
問題 | No.797 Noelちゃんとピラミッド |
ユーザー | Coki628 |
提出日時 | 2020-08-21 00:04:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 1,714 bytes |
コンパイル時間 | 363 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 93,312 KB |
最終ジャッジ日時 | 2024-04-21 19:24:42 |
合計ジャッジ時間 | 6,719 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
52,352 KB |
testcase_01 | AC | 37 ms
52,352 KB |
testcase_02 | AC | 38 ms
52,736 KB |
testcase_03 | AC | 85 ms
92,928 KB |
testcase_04 | AC | 85 ms
93,056 KB |
testcase_05 | AC | 83 ms
92,928 KB |
testcase_06 | AC | 85 ms
93,056 KB |
testcase_07 | AC | 85 ms
93,184 KB |
testcase_08 | AC | 84 ms
93,056 KB |
testcase_09 | AC | 85 ms
93,184 KB |
testcase_10 | AC | 85 ms
92,928 KB |
testcase_11 | AC | 86 ms
93,056 KB |
testcase_12 | AC | 87 ms
93,184 KB |
testcase_13 | AC | 84 ms
92,928 KB |
testcase_14 | AC | 84 ms
93,184 KB |
testcase_15 | AC | 84 ms
93,184 KB |
testcase_16 | AC | 84 ms
93,056 KB |
testcase_17 | AC | 84 ms
93,312 KB |
testcase_18 | AC | 83 ms
93,312 KB |
testcase_19 | AC | 86 ms
92,928 KB |
testcase_20 | AC | 84 ms
93,312 KB |
testcase_21 | AC | 84 ms
93,312 KB |
testcase_22 | AC | 83 ms
93,056 KB |
testcase_23 | AC | 75 ms
84,352 KB |
testcase_24 | AC | 58 ms
70,016 KB |
testcase_25 | AC | 71 ms
81,536 KB |
testcase_26 | AC | 70 ms
80,128 KB |
testcase_27 | AC | 84 ms
93,056 KB |
testcase_28 | AC | 79 ms
89,600 KB |
testcase_29 | AC | 54 ms
67,456 KB |
testcase_30 | AC | 58 ms
69,504 KB |
testcase_31 | AC | 75 ms
84,480 KB |
testcase_32 | AC | 61 ms
72,192 KB |
testcase_33 | AC | 71 ms
81,280 KB |
testcase_34 | AC | 65 ms
76,032 KB |
testcase_35 | AC | 84 ms
93,312 KB |
testcase_36 | AC | 53 ms
66,816 KB |
testcase_37 | AC | 81 ms
89,856 KB |
testcase_38 | AC | 83 ms
92,160 KB |
testcase_39 | AC | 71 ms
81,152 KB |
testcase_40 | AC | 53 ms
66,432 KB |
testcase_41 | AC | 55 ms
68,352 KB |
testcase_42 | AC | 70 ms
80,128 KB |
testcase_43 | AC | 36 ms
52,608 KB |
testcase_44 | AC | 37 ms
52,736 KB |
testcase_45 | AC | 36 ms
52,864 KB |
testcase_46 | AC | 38 ms
52,480 KB |
testcase_47 | AC | 37 ms
52,736 KB |
testcase_48 | AC | 37 ms
52,864 KB |
testcase_49 | AC | 37 ms
52,992 KB |
testcase_50 | AC | 36 ms
52,352 KB |
testcase_51 | AC | 37 ms
52,864 KB |
testcase_52 | AC | 37 ms
52,480 KB |
testcase_53 | AC | 37 ms
52,352 KB |
testcase_54 | AC | 37 ms
52,352 KB |
testcase_55 | AC | 39 ms
52,608 KB |
testcase_56 | AC | 38 ms
52,608 KB |
testcase_57 | AC | 38 ms
52,480 KB |
testcase_58 | AC | 38 ms
52,480 KB |
testcase_59 | AC | 37 ms
52,352 KB |
testcase_60 | AC | 36 ms
52,736 KB |
testcase_61 | AC | 37 ms
52,736 KB |
testcase_62 | AC | 37 ms
52,352 KB |
ソースコード
import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 19 MOD = 10 ** 9 + 7 EPS = 10 ** -10 class ModTools: """ 階乗・逆元用のテーブルを構築する """ def __init__(self, MAX, MOD): # nCrならn、nHrならn+rまで作る MAX += 1 self.MAX = MAX self.MOD = MOD factorial = [1] * MAX factorial[0] = factorial[1] = 1 for i in range(2, MAX): factorial[i] = factorial[i-1] * i % MOD inverse = [1] * MAX inverse[MAX-1] = pow(factorial[MAX-1], MOD-2, MOD) for i in range(MAX-2, -1, -1): inverse[i] = inverse[i+1] * (i+1) % MOD self.fact = factorial self.inv = inverse def nCr(self, n, r): """ 組み合わせ """ if n < r: return 0 r = min(r, n-r) numerator = self.fact[n] denominator = self.inv[r] * self.inv[n-r] % self.MOD return numerator * denominator % self.MOD N = INT() A = LIST() C = [0] * N mt = ModTools(N, MOD) for i in range(N): C[i] = mt.nCr(N-1, i) ans = 0 for i in range(N): ans += A[i] * C[i] ans %= MOD print(ans)