Pagini recente » Cod sursa (job #469387) | Cod sursa (job #2525577) | Cod sursa (job #2549564) | Cod sursa (job #571245) | Cod sursa (job #3320480)
#include <fstream>
using namespace std;
const int MOD=9999991;
long long putere(long long a, int b)
{
long long r=1;
while(b)
{
if(b&1)r=1LL*r*a%MOD;
a=1LL*a*a&MOD;
b>>=1;
}
return r;
}
int main()
{
ifstream fin("dirichlet.in");
ofstream fout("dirichlet.out");
int n, i, f1=1, f2=1, in=1;
fin >> n;
for(i=1; i<=n; ++i)
f2=1LL*f2*i%MOD;
for(i=n+2; i<=2*n; ++i)
f1=1LL*f1*i%MOD;
in=putere(f2, MOD-2);
long long sol=1LL*f1*in%MOD;
fout<<sol<<'\n';
fin.close();
fout.close();
return 0;
}