Cod sursa(job #2223664)
Utilizator | Data | 20 iulie 2018 22:18:33 | |
---|---|---|---|
Problema | Dirichlet | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<fstream>
#define MOD 9999991LL
using namespace std;
ifstream fi("dirichlet.in");
ofstream fo("dirichlet.out");
int n,i,rez,imp;
int p(int a, int b)
{
int rez=1;
for(i=0; (1<<i)<=b; i++)
{
if((1<<i)&b)
rez=(1LL*rez*a)%MOD;
a=(1LL*a*a)%MOD;
}
return rez;
}
int main()
{
fi>>n;
rez=imp=1;
for(i=n+2; i<=2*n; i++)
rez=(1LL*rez*i)%MOD;
for(i=2; i<=n; i++)
imp=(1LL*imp*i)%MOD;
rez=(1LL*rez*p(imp,MOD-2))%MOD;
fo<<rez<<"\n";
fi.close();
fo.close();
return 0;
}