結果
問題 | No.2181 LRM Question 2 |
ユーザー | tassei903 |
提出日時 | 2023-01-06 23:31:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 717 ms / 2,000 ms |
コード長 | 2,992 bytes |
コンパイル時間 | 1,276 ms |
コンパイル使用メモリ | 87,024 KB |
実行使用メモリ | 89,996 KB |
最終ジャッジ日時 | 2023-08-20 17:03:30 |
合計ジャッジ時間 | 7,047 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
70,988 KB |
testcase_01 | AC | 77 ms
70,992 KB |
testcase_02 | AC | 457 ms
77,536 KB |
testcase_03 | AC | 76 ms
70,988 KB |
testcase_04 | AC | 85 ms
75,932 KB |
testcase_05 | AC | 76 ms
71,212 KB |
testcase_06 | AC | 81 ms
75,392 KB |
testcase_07 | AC | 77 ms
70,992 KB |
testcase_08 | AC | 551 ms
77,056 KB |
testcase_09 | AC | 382 ms
78,032 KB |
testcase_10 | AC | 708 ms
77,264 KB |
testcase_11 | AC | 716 ms
77,036 KB |
testcase_12 | AC | 717 ms
77,344 KB |
testcase_13 | AC | 88 ms
75,608 KB |
testcase_14 | AC | 151 ms
89,996 KB |
testcase_15 | AC | 87 ms
76,224 KB |
testcase_16 | AC | 153 ms
87,908 KB |
testcase_17 | AC | 96 ms
76,228 KB |
testcase_18 | AC | 108 ms
77,060 KB |
testcase_19 | AC | 94 ms
76,092 KB |
testcase_20 | AC | 106 ms
79,260 KB |
testcase_21 | AC | 149 ms
77,260 KB |
testcase_22 | AC | 109 ms
77,272 KB |
testcase_23 | AC | 77 ms
71,404 KB |
testcase_24 | AC | 75 ms
71,240 KB |
testcase_25 | AC | 77 ms
71,496 KB |
ソースコード
import sys input = lambda :sys.stdin.readline()[:-1] ni = lambda :int(input()) na = lambda :list(map(int,input().split())) yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES") no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO") ####################################################################### class BinomialCoefficient: def __init__(self, m): self.MOD = m self.factorization = self._factorize(m) self.facs = [] self.invs = [] self.coeffs = [] self.pows = [] for p, pe in self.factorization: fac = [1]*pe for i in range(1, pe): fac[i] = fac[i-1]*(i if i % p else 1) % pe inv = [1]*pe inv[-1] = fac[-1] for i in range(1, pe)[::-1]: inv[i-1] = inv[i]*(i if i % p else 1) % pe self.facs.append(fac) self.invs.append(inv) # coeffs c = self._modinv(m // pe, pe) self.coeffs.append(m//pe*c % m) # pows powp = [1] while powp[-1]*p != pe: powp.append(powp[-1]*p) self.pows.append(powp) def __call__(self, n, k): if k < 0 or k > n: return 0 if k == 0 or k == n: return 1 % self.MOD res = 0 for i, (p, pe) in enumerate(self.factorization): res += self._choose_pe(n, k, p, pe, self.facs[i], self.invs[i], self.pows[i]) * self.coeffs[i] res %= self.MOD return res def _E(self, n, k, r, p): res = 0 while n: n //= p k //= p r //= p res += n - k - r return res def _choose_pe(self, n, k, p, pe, fac, inv, powp): r = n-k e0 = self._E(n, k, r, p) if e0 >= len(powp): return 0 res = powp[e0] if (p != 2 or pe == 4) and self._E(n//(pe//p), k//(pe//p), r//(pe//p), p) % 2: res = pe-res while n: res = res * fac[n % pe] % pe * inv[k % pe] % pe * inv[r % pe] % pe n //= p k //= p r //= p return res def _factorize(self, N): factorization = [] for i in range(2, N+1): if i*i > N: break if N % i: continue c = 0 while N % i == 0: N //= i c += 1 factorization.append((i, i**c)) if N != 1: factorization.append((N, N)) return factorization def _modinv(self, a, MOD): r0, r1, s0, s1 = a, MOD, 1, 0 while r1: r0, r1, s0, s1 = r1, r0 % r1, s1, s0-r0//r1*s1 return s0 % MOD l, r, m = na() from math import * ans = -(r-l+1)*2 ans %= m c = BinomialCoefficient(m) for i in range(l, r+1): ans += c(2*i,i) ans %= m print(ans)