1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-8bf5a5fa194d2ba8.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-8bf5a5fa194d2ba8.js"],"CodeViewer"] 1c:T5c5,#include using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; typedef tuple tiii; const ll MOD1 = 97, MOD2 = 1031; const ll MOD = 100007; ll DnC(ll v, ll e, ll mod) { if(e == 0) return 1; ll b = DnC(v, e/2, mod); if(e%2) return ((b*b)%mod)*v%mod; else return b*b%mod; } ll nCr(ll N, ll M, ll mod) { if(N < M) return 0; ll num = 1, den = 1; for(ll i=1; i<=N; i++) num *= i, num %= mod; for(ll i=1; i<=M; i++) den *= i, den %= mod; for(ll i=1; i<=N-M; i++) den *= i, den %= mod; ll inv = DnC(den, mod-2, mod); return num * inv % mod; } ll lucas(ll N, ll M, ll mod) { vector Ns, Ms; while(N || M) { Ns.push_back(N%mod), N/=mod; Ms.push_back(M%mod), M/=mod; } ll ret = 1; for(int i=0; i> N >> M; if(N == 0) { if(M == 1) cout << 1 << "\n"; else cout << 0 << "\n"; } else if(M == 1) cout << 0 << "\n"; else { N -= 1, M -= 2; cout << ((lucas(N, M, MOD1)*MOD2*DnC(MOD2, MOD1-2, MOD1))%MOD +(lucas(N, M, MOD2)*MOD1*DnC(MOD1, MOD2-2, MOD2))%MOD)%MOD << "\n"; } } int main

코드 #635