Cod sursa(job #635956)
| Utilizator | Data | 19 noiembrie 2011 15:55:48 | |
|---|---|---|---|
| Problema | Dirichlet | Scor | 8 |
| Compilator | cpp | Status | done |
| Runda | .com 2011 | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int n,sol,C[2];
int MOD=9999991;
inline int Catalan()
{
if(n<2)
return 1;
long long i,x,aux;
C[0]=1;
for(i=2;i<=n;i++)
{
x=(long long)C[0];
aux=(long long)(4*i-2);
x*=aux;
aux=(long long)(i+1);
x/=aux;
C[1]=(int)(x%MOD);
C[0]=C[1];
}
return C[1];
}
int main()
{
ifstream fin("dirichlet.in");
fin>>n;
fin.close();
sol=Catalan();
ofstream fout("dirichlet.out");
fout<<sol<<"\n";
fout.close();
return 0;
}
