Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 128000/128000 K (Java/Others)
Total Submission(s): 3126 Accepted Submission(s): 978
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=10007;
int n,m,P;
bool notp[N];
int p[N];
void sieve(int n){
for(int i=2;i<=n;i++){
if(!notp[i]) p[++p[0]]=i;
for(int j=1;j<=p[0]&&i*p[j]<=n;j++){
notp[i*p[j]]=1;
if(i%p[j]==0) break;
}
}
}
int fac[N][1300],mp[N],pnum;
void ini(int n){
sieve(n);
for(int j=1;j<=p[0];j++){
int x=p[j];mp[x]=j;
fac[0][j]=1;
for(int i=1;i<=n;i++) fac[i][j]=fac[i-1][j]*i%x;
}
}
int Pow(int a,int b){
int re=1;
for(;b;b>>=1,a=a*a%P)
if(b&1) re=re*a%P;
return re;
}
int Inv(int a){return Pow(a,P-2);}
int C(int n,int m){
if(n<m) return 0;
return fac[n][pnum]*Inv(fac[m][pnum])%P*Inv(fac[n-m][pnum])%P;
}
int Lucas(int n,int m){
if(n<m) return 0;
int re=1;
for(;m;n/=P,m/=P) re=re*C(n%P,m%P)%P;
return re;
}
int main(){
freopen("in","r",stdin);
int cas=0;
ini(10000);
while(scanf("%d%d%d",&n,&m,&P)!=EOF){
if(m>n/2) m=n-m;
pnum=mp[P];
printf("Case #%d: %d\n",++cas,(Lucas(n+1,m)+n-m)%P);
}
}
本站转载的文章为个人学习借鉴使用,本站对版权不负任何法律责任。如果侵犯了您的隐私权益,请联系我们删除。