Pagini recente » Cod sursa (job #21347) | Cod sursa (job #365024) | Cod sursa (job #2594876) | Cod sursa (job #106948) | Cod sursa (job #2002220)
#include <cstdio>
#include <cstring>
using namespace std;
const int nmax=104;
int d[nmax][nmax],n;
char ch[nmax];
void citire()
{
scanf("%s",ch);
n=strlen(ch);
}
void solve()
{
for(int i=0;i<n;i++)
{
for(int j=0;j<i;j++) d[i][j]=1;
}
for(int i=0;i<n-2;i++)
{
if(ch[i]==ch[i+2]) d[i][i+2]=1;
}
for(int j=3;j<=n;j++)
{
for(int i=0;i<n-j;i++)
{
int p1=i,p2=i+j;
for(int k=p1;k<=p2;k++)
{
if(d[p1][k]&&d[k+1][p2])
{
d[p1][p2]=1;
break;
}
if(ch[p1]==ch[p2])
{
if(d[p1+1][k-1]&&d[k+1][p2-1])
{
d[p1][p2]=1;
break;
}
}
}
}
}
if(d[0][n-1]) printf("DA\n");
else printf("NU\n");
}
void reset()
{
for(int i=0;i<=100;i++)
{
for(int j=0;j<=100;j++) d[i][j]=0;
}
}
int main()
{
freopen ("palin3.in","r",stdin);
freopen ("palin3.out","w",stdout);
int t;
scanf("%d",&t);
for(;t>0;--t)
{
citire();
solve();
reset();
}
}