Cod sursa(job #2503047)
Utilizator | Data | 2 decembrie 2019 11:09:31 | |
---|---|---|---|
Problema | Dirichlet | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
const int MOD=9999991;
long long power(long long a,int b)
{
long long p=1;
while(b)
{
if(b&1)
p=p*a%MOD;
a=a*a%MOD;
b>>=1;
}
return p;
}
int main()
{
int n;
f>>n;
long long a=1,b=1;
for(int i=2;i<=n;i++)
{
a=a*(n+i) % MOD;
b=b*i % MOD;
}
g<<a*power(b,MOD-2)%MOD;
return 0;
}