Cod sursa(job #647718)
| Utilizator | Data | 11 decembrie 2011 21:13:54 | |
|---|---|---|---|
| Problema | Invers | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
long long double invers(long long double x)
{ long long nr=0;
while(x!=0)
{
nr=nr*10+x%10;
x=x/10;
}
return nr;
}
int main()
{ freopen("invers.in","r",stdin);
freopen("invers.out","w",stdout);
long long double n;
short t;
short ok;
scanf("%d",&t);
for(int i=1;i<=t;i++)
{ ok=0;
scanf("%lld",&n);
for(int j=1;j<=n;j++)
if(j+invers(j)==n)
{ printf("DA\n");
ok=1;
break;
}
if(ok!=1)
printf("NU\n");
}
return 0;
}
