Pagini recente » Cod sursa (job #3204304) | Cod sursa (job #1263188) | Cod sursa (job #1459951) | Cod sursa (job #1415202) | Cod sursa (job #979957)
Cod sursa(job #979957)
#include<fstream>
#define X 990
#define Nmax 1000
#define inf 99999999
using namespace std;
ifstream f("culori.in");
ofstream g("culori.out");
int n,v[Nmax],a[Nmax][Nmax];
void init()
{
f>>n; n=2*n-1;
for(int i=1;i<=n;i++)f>>v[i];
}
void Solve()
{
for(int i=1;i<=n;i++)a[i][i]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(v[i+j]==v[j])
for(int k=j+1;k<=i+j;k++)
{
a[j][i+j]+=(a[j+1][k]*a[k+1][i+j]);
a[j][i+j]%=X;
}
g<<a[1][n]<<'\n';
}
int main()
{
init();
Solve();
f.close();g.close();
return 0;
}