Pagini recente » Arhiva de probleme | Cod sursa (job #3238101) | Cod sursa (job #535999) | Cod sursa (job #1802704) | Cod sursa (job #2908530)
#include <fstream>
using namespace std;
const int mod=9999991;
long long lgput(long long baza,int exp){
long long rez=1;
for(int i=exp;i>=1;i>>=1){
if(i&1){
rez=(1LL*rez*baza)%mod;
}
baza=(1LL*baza*baza)%mod;
}
return rez;
}
int main()
{
ifstream fin("dirichlet.in");
ofstream fout("dirichlet.out");
int n;fin>>n;int i,fact1=1,fact2=1,invfact2=1;
for(i=1;i<=n;i++){
fact2=(1LL*fact2*i)%mod;
}
for(i=n+2;i<=2*n;i++){
fact1=(1LL*fact1*i)%mod;
}
invfact2=lgput(fact2,mod-2);
long long rez=(1LL*fact1*invfact2)%mod;
fout<<rez<<'\n';
return 0;
}