Cod sursa(job #3243092)
Utilizator | Data | 15 septembrie 2024 17:22:46 | |
---|---|---|---|
Problema | Dirichlet | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include <iostream>
using namespace std;
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;
cin>>n;
catalan(n);
cout<<c[n];
return 0;
}