Pagini recente » Cod sursa (job #468809) | Cod sursa (job #1470575) | Cod sursa (job #2305766) | Cod sursa (job #1785593) | Cod sursa (job #1394470)
//se cere al N-lea numar Catalan
#include <stdio.h>
#define MOD 9999991LL
inline int lgput(int a, int n){
int rez=1;
a%=MOD;
while(n!=0){
if(n%2==1){
rez=(rez*(long long)a)%MOD;
}
n/=2;
a=(a*(long long)a)%MOD;
}
return rez;
}
int main(){
int ans, i, n, k;
FILE *fin, *fout;
fin=fopen("dirichlet.in", "r");
fout=fopen("dirichlet.out", "w");
fscanf(fin, "%d", &n);
ans=1;
for(i=n+2; i<=2*n; i++){
ans=(ans*(long long)i)%MOD;
}
k=1;
for(i=2; i<=n; i++){
k=(k*(long long)i)%MOD;
}
ans=(ans*(long long)lgput(k, MOD-2))%MOD;
fprintf(fout, "%d\n", ans);
fclose(fin);
fclose(fout);
return 0;
}