Pagini recente » Cod sursa (job #2262989) | Cod sursa (job #2865853) | Cod sursa (job #2564579) | Cod sursa (job #2641176) | Cod sursa (job #2045018)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("culori.in");
ofstream fout("culori.out");
int n,m,a[1200][1200],c[600];
int main()
{
int i,j;
fin >> n;
m=n*2-1;
for(i=1;i<=m;i++)
{
fin >> c[i];
a[i][i]=1;
}
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(c[i+j]==c[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]%=9901;
}
fout << a[1][m];
return 0;
}