結果
問題 | No.2181 LRM Question 2 |
ユーザー | MasKoaTS |
提出日時 | 2022-10-19 20:00:37 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,259 bytes |
コンパイル時間 | 1,580 ms |
コンパイル使用メモリ | 86,664 KB |
実行使用メモリ | 351,280 KB |
最終ジャッジ日時 | 2023-09-12 08:34:37 |
合計ジャッジ時間 | 21,349 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,184 KB |
testcase_01 | AC | 72 ms
71,260 KB |
testcase_02 | AC | 1,570 ms
281,264 KB |
testcase_03 | AC | 71 ms
71,108 KB |
testcase_04 | AC | 241 ms
123,296 KB |
testcase_05 | AC | 84 ms
76,288 KB |
testcase_06 | AC | 83 ms
76,144 KB |
testcase_07 | AC | 76 ms
74,784 KB |
testcase_08 | AC | 1,917 ms
351,048 KB |
testcase_09 | AC | 1,405 ms
281,536 KB |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | AC | 1,193 ms
140,336 KB |
testcase_13 | AC | 94 ms
76,380 KB |
testcase_14 | AC | 765 ms
275,240 KB |
testcase_15 | AC | 289 ms
141,096 KB |
testcase_16 | AC | 692 ms
273,204 KB |
testcase_17 | AC | 821 ms
291,208 KB |
testcase_18 | AC | 572 ms
248,044 KB |
testcase_19 | AC | 483 ms
223,532 KB |
testcase_20 | AC | 936 ms
282,048 KB |
testcase_21 | AC | 960 ms
292,252 KB |
testcase_22 | AC | 383 ms
170,824 KB |
testcase_23 | AC | 72 ms
71,040 KB |
testcase_24 | AC | 72 ms
71,208 KB |
testcase_25 | AC | 72 ms
71,032 KB |
ソースコード
import sys input = sys.stdin.readline class BinomialCoefficient: def __init__(self, mod): self.mod = mod self.prime = self.prime_factorize(mod) self.facs = [] self.invs = [] self.pows = [] self.mods = {} for p, c in self.prime: pc = pow(p, c) fac = [1] * pc inv = [1] * pc for i in range(1, pc): k = i if(i % p == 0): k = 1 fac[i] = fac[i - 1] * k % pc inv[-1] = fac[-1] for i in range(pc - 1, 0, -1): k = i if(i % p == 0): k = 1 inv[i - 1] = inv[i] * k % pc self.facs.append(fac) self.invs.append(inv) pw = [1] while(pw[-1] * p != pc): pw.append(pw[-1] * p) self.pows.append(pw) for i in range(mod): r = [i % pow(p, c) for p, c in self.prime] self.mods[tuple(r)] = i def prime_factorize(self, n): prime = [] f = 2 while(f * f <= n): if(n % f == 0): n //= f cnt = 1 while(n % f == 0): n //= f cnt += 1 prime.append((f, cnt)) f += 1 if(n != 1): prime.append((n, 1)) return prime def inv_gcd(self, n, m): n %= m if(n == 0): return m, 0 s, t, m0, m1 = m, n, 0, 1 while(t): u = s // t s -= t * u m0 -= m1 * u m0, m1, s, t = m1, m0, t, s if(m0 < 0): m0 += m // s return s, m0 def inv_mod(self, n, m): g, im = self.inv_gcd(n, m) return im def calc_e(self, n, k, r, p): e = 0 while(n): n //= p e += n while(k): k //= p e -= k while(r): r //= p e -= r return e def lucas(self, n, k, p, c, i): pw = self.pows[i] fac = self.facs[i] inv = self.invs[i] r = n - k pc = pow(p, c) e = self.calc_e(n, k, r, p) if(e >= len(pw)): return 0 ret = pw[e] if((p != 2 or c < 3) and (self.calc_e(n // pw[-1], k // pw[-1], r // pw[-1], p) & 1)): ret *= -1 while(n): ret *= fac[n % pc] * inv[k % pc] * inv[r % pc] ret %= pc n //= p k //= p r //= p return ret def __call__(self, n, k): if(k < 0 or k > n): return 0 if(k == 0 or k == n): return 1 r = [self.lucas(n, k, p, c, i) for i, (p, c) in enumerate(self.prime)] return self.mods[tuple(r)] """ Main Code """ l, r, m = map(int, input().split()) nCk = BinomialCoefficient(m) ans = 0 for i in range(l, r + 1): ans += nCk(2 * i, i) + m - 2 ans %= m print(ans)