Cod sursa(job #3319515)
| Utilizator | Data | 1 noiembrie 2025 19:20:29 | |
|---|---|---|---|
| Problema | Dirichlet | Scor | 8 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int MOD=9999991;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
int N;
unsigned long long C=1;
int main()
{
f >> N;
for(int i=1;i<=N;i++){
C*=(2*N-i+1)%MOD;
C/=i%MOD;
}
C/=(N+1)%MOD;
g << C;
return 0;
}
