Pagini recente » Cod sursa (job #1133255) | Cod sursa (job #1788546) | Cod sursa (job #889871) | Cod sursa (job #1084489) | Cod sursa (job #34068)
Cod sursa(job #34068)
#include<stdio.h>
#define nmax 259
#define nrm 600
#define ko 9901
int a[nmax][nmax],s[nrm],n;
int rezolva()
{int i,l,k;
for(i=1;i<=n;i++)
if(s[i]==s[i+2])
a[i][i+2]=1;
for(l=4;l<2*n-1;l+=2)
for(i=1;i<=n;i++)
if(s[i]==s[i+l])
for(k=i+2;k<i+l&&k+l<n;k+=2)
if(s[k]==s[i])
a[i][i+l]=(a[i][i+l]+/*a[i][k]*a[k][i+l]*/+a[i][k]+a[k][i+l])%ko;
return a[1][2*n-1];
}
int main()
{int i;
freopen("culori.in","r",stdin);
scanf("%d",&n);
for(i=1;i<=2*n-1;i++)
scanf("%d",&s[i]);
freopen("culori.out","w",stdout);
printf("%d",rezolva());
fclose(stdout);
return 0;
}