Cod sursa(job #2079290)
Utilizator | Data | 30 noiembrie 2017 22:04:00 | |
---|---|---|---|
Problema | Dirichlet | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<bits/stdc++.h>
#define ross 9999991
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
int n;
long long rs=1,aux=1;
long long POW(long long a, long long b)
{
long long ans=1;
while(b){
if(b&1)
ans=(ans*a)%ross,--b;
else
a=(a*a)%ross,b/=2;
}
return ans;
}
int main()
{
f>>n;
for(long long i=n+2;i<=n+n;++i)
rs=(rs*i)%ross;
for(long long i=1;i<=n;++i)
aux=(aux*i)%ross;
g<<(rs*POW(aux,ross-2))%ross;
return 0;
}