Cod sursa(job #2331253)
Utilizator | Data | 29 ianuarie 2019 13:32:27 | |
---|---|---|---|
Problema | Dirichlet | Scor | 4 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <math.h>
#include <fstream>
using namespace std;
ifstream fin("dirichlet.in");
ofstream fout("dirichlet.out");
long long n, m, i, j, fact, doin, n1, n2;
int main(){
fin>>n;
fact=1;
for(i=2; i<=n; i++){
fact*=i;
fact%=9999991;
}
n1=fact;
fact*=(n+1);
fact%=9999991;
n2=fact;
for(i=n+2; i<=2*n; i++){
fact*=i;
fact%=9999991;
}
doin=fact;
fout<<(doin/n1)/n2;
}