Cod sursa(job #635535)
Utilizator | FMI Ciprian Olariu scipianus | Data | 19 noiembrie 2011 12:55:12 |
---|---|---|---|
Problema | Dirichlet | Scor | 8 |
Compilator | cpp | Status | done |
Runda | .com 2011 | Marime | 0.44 kb |
#include<fstream>
#include<cstring>
#define MOD 9999991
using namespace std;
int n,sol,C[1000010];
void Catalan()
{
int i;
long long x;
C[0]=C[1]=1;
C[2]=2;
for(i=3;i<=n;i++)
{
x=(long long)C[i-1];
x*=(4*i-2);
x/=(i+1);
C[i]=(int)(x%MOD);
}
}
int main()
{
ifstream fin("dirichlet.in");
fin>>n;
fin.close();
Catalan();
ofstream fout("dirichlet.out");
fout<<C[n]<<"\n";
fout.close();
return 0;
}