Cod sursa(job #720512)
| Utilizator | Data | 22 martie 2012 18:28:35 | |
|---|---|---|---|
| Problema | Invers | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<cstdio>
#include<algorithm>
#include<fstream>
#define FOR for(i=1;i<=n;i++)
using namespace std;
ifstream f("invers.in");
ofstream g("invers.out");
long int invers(long int x)
{
long int nr=0;
while(x!=0)
{
nr=nr*10+x%10;
x=x/10;
}
return nr;
}
long long n;
int t;
short ok;
int i;
int main()
{
f>>n;
FOR
{
ok=0;
f>>t;
for(long int j=1;j<=t;j++)
if(j+invers(j)==n)
{
g<<"DA"<<"\n";
ok=1;
break;
}
if(ok!=1)
g<<"NU"<<"\n";
}
return 0;
}
