Pagini recente » Cod sursa (job #636618) | Paginatie | Monitorul de evaluare | Cod sursa (job #3151776) | Cod sursa (job #21083)
Cod sursa(job #21083)
#include<stdio.h>
int main()
{
long T, n, i, t=0, s=0, j, k, inv=0, nr[100000];
freopen("invers.in", "r", stdin);
freopen("invers.out", "w", stdout);
scanf("%ld", &T);
for(i=1;i<=T;i++)
{ scanf("%ld", &nr[i]); }
for(i=1;i<=T;i++)
{
n=nr[i]; t=0;
for(j=1;j<=n;j++)
{ k=j; s=0;
while(k!=0)
{ s=s*10+k%10;
k=k/10;
}
if(s+j==n)
t=1;
}
if(t==1)
{ printf("DA");
printf("\n"); }
else
{ printf("NU");
printf("\n"); }
}
return 0;
}