Pagini recente » Cod sursa (job #1809933) | Cod sursa (job #2372502) | Cod sursa (job #1031713) | Cod sursa (job #2727840) | Cod sursa (job #3180466)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("culori.in");
ofstream of("culori.out");
int n, c[512],s[512][512],ok,ok2,ok3=1,ix,jx;
long nr;
int main()
{
f>>n;
n=(n*2)-1;
for(int i=1;i<=n;i++)f>>c[i];
if(c[1]==c[n])
{
while(ok3)
{
ok3=0;
int i=1;
for(int j=1;j<=n;j++)
{
ok=0;
if(c[i]==c[j] && !s[i][j] && i!=j)
{
ok2=1;
ix=i;
jx=j;
while(ix<=jx)
{
if(c[ix]!=c[jx])ok2=0;
ix++;
jx--;
}
}
if(ok2)
{
s[i][j]=1;
i=j;
ok=1;
ok2=0;
ok3=1;
}
}
if(ok)
{
nr++;
}
}
}
of<<nr%9901;
return 0;
}