結果
問題 | No.2120 場合の数の下8桁 |
ユーザー |
![]() |
提出日時 | 2022-11-07 22:19:09 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,904 bytes |
コンパイル時間 | 247 ms |
コンパイル使用メモリ | 81,792 KB |
実行使用メモリ | 258,192 KB |
最終ジャッジ日時 | 2024-07-21 05:34:28 |
合計ジャッジ時間 | 5,893 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 17 WA * 3 |
ソースコード
import sys# sys.setrecursionlimit(200005)int1 = lambda x: int(x)-1pDB = lambda *x: print(*x, end="\n", file=sys.stderr)p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)def II(): return int(sys.stdin.readline())def LI(): return list(map(int, sys.stdin.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LI1(): return list(map(int1, sys.stdin.readline().split()))def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def SI(): return sys.stdin.readline().rstrip()dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = (1 << 63)-1# inf = (1 << 31)-1# md = 10**9+7md = 998244353import typingdef inv_gcd(a, b):a %= bif a == 0: return b, 0s, t = b, am0, m1 = 0, 1while t:u = s//ts -= t*um0 -= m1*us, t = t, sm0, m1 = m1, m0if m0 < 0: m0 += b//sreturn s, m0# 複数の「mで割ったらr余る」という条件を満たすxをmod zで返す# 返り値 x,z(解なしの場合は0,0)def crt(r: typing.List[int], m: typing.List[int]) -> typing.Tuple[int, int]:assert len(r) == len(m)n = len(r)r0, m0 = 0, 1for i in range(n):assert 1 <= m[i]r1 = r[i]%m[i]m1 = m[i]if m0 < m1:r0, r1 = r1, r0m0, m1 = m1, m0if m0%m1 == 0:if r0%m1 != r1: return 0, 0continueg, im = inv_gcd(m0, m1)u1 = m1//gif (r1-r0)%g: return 0, 0x = (r1-r0)//g%u1*im%u1r0 += x*m0m0 *= u1if r0 < 0: r0 += m0return r0, m0def inv(a, p, e):m = p**ea0 = ares = {1: 1}aa = [a]while aa:a = aa.pop()if m%a%p:b = m%aif b in res:res[a] = m-m//a*res[b]%melse:aa.append(a)aa.append(b)else:b = a-m%aif b in res:res[a] = res[b]*(m//a+1)%melse:aa.append(a)aa.append(b)return res[a0]def trim(a):x = y = 0while a & 1 == 0:a >>= 1x += 1while a%5 == 0:a //= 5y += 1return a, x, ym = II()n = II()if m < n:print(0)exit()if m-n < n: n = m-naa, bb = [], []cnt = [0, 0]for i in range(n):a, c2, c5 = trim(m-i)cnt[0] += c2cnt[1] += c5aa.append(a)b, c2, c5 = trim(i+1)bb.append(b)cnt[0] -= c2cnt[1] -= c5rr = []for p in [2, 5]:m = p**8x = y = 1for a in aa: x = x*a%mc2, c5 = cntx = x*pow(2, c2, m)%m*pow(5, c5, m)%mfor b in bb: y = y*b%my = inv(y, p, 8)rr.append(x*y%m)ans, _ = crt(rr, [2**8, 5**8])ans = str(ans).zfill(8)print(ans)