Cod sursa(job #3243093)
Utilizator | Data | 15 septembrie 2024 17:24:47 | |
---|---|---|---|
Problema | Dirichlet | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dirichlet.in");
ofstream g("dirichlet.out");
const int MOD=9999991;
int c[1001];
void catalan(int n)
{
c[0]=c[1]=1;
for(int i=2;i<=n;i++)
for(int j=1;j<=i;j++)
c[i]=(c[i]+1LL*c[j-1]*c[i-j])%MOD;
}
int main()
{
int n;
f>>n;
catalan(n);
g<<c[n];
f.close();
g.close();
return 0;
}