Cod sursa(job #3317394)
| Utilizator | Data | 23 octombrie 2025 16:16:51 | |
|---|---|---|---|
| Problema | Dirichlet | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#define M 9999991
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
long long n,s=1,t=1;
long long putere(long long x,long long n)
{
if(n==0) return 1;
if(n==1) return x;
long long a=putere(x,n/2);
a=(a*a)%M;
if(n%2==1) a=(a*x)%M;
return a;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
s=(s*i)%M;
for(int i=n+2;i<=2*n;i++)
t=(t*i)%M;
s=putere(s,M-2);
g<<(s*t)%M;
return 0;
}
