Pagini recente » Cod sursa (job #2188164) | Cod sursa (job #1753583) | Cod sursa (job #2384562) | Cod sursa (job #2378909) | Cod sursa (job #593789)
Cod sursa(job #593789)
# include <cstdio>
# include <cstring>
const char *FIN = "invers.in", *FOU = "invers.out" ;
char SS[10005], S1[10005];
int T ;
int check (char *S, int L, int N) {
for (int i = L, j = N - 1, k; ; ++i, --j) {
if (i == j) {
return (S[i] & 1) == 0 ;
} else if (j - i == 1) {
return (S[i] == S[j] || (S[i] == S[j] + 11)) ;
} else {
switch (S[i] - S[j])
{
case 0: break;
case 1: S[i + 1] += 10; break;
case 11:
S[i + 1] += 10;
case 10:
if (S[j] == 9) return 0;
for (S[k = j - 1]--; S[k] < 0 && k >= i; )
S[k] += 10, S[--k]--;
if (k == i) return 0;
break;
default: return 0;
}/*
if (S[i] - S[j] == 1) {
S[i + 1] += 10 ;
} else if (S[i] - S[j] == 11) {
S[i + 1] += 10 ; return 0 ;
} else if (S[i] - S[j] == 10) {
if (S[j] == 9) return 0;
for (--S[k = j - 1] ; S[k] < 0 && k >= i ; --S[--k])
S[k] += 10 ;
if (k == i) return 0;
} else if (S[i] - S[j] == 0) {
continue ;
} else {
return 0 ;
}*/
}
}
}
const char *solve (char *S, int N) {
if (N == 1) return (S[0] & 1) ? "NU" : "DA";
else if (N == 2) return (S[0] == S[1] || (S[0] == 1 && (S[1] & 1) == 0)) ? "DA" : "NU" ;
else if (S[0] == 1) {
memcpy (S1, S, sizeof(S));
S[1] += 10 ;
if (check (S, 1, N)) return "DA" ;
else if (S[0] == 1 && S[N - 1] == 0) {
return "NU" ;
} else {
memcpy (S, S1, sizeof (S1)) ;
return check (S, 0, N) ? "DA" : "NU" ;
}
} else {
return check (S, 0, N) ? "DA" : "NU" ;
}
return "NU";
}
int main (void) {
freopen (FIN, "r", stdin) ;
freopen (FOU, "w", stdout) ;
for (scanf ("%d", &T); T; --T) {
scanf ("%s", SS) ;
for (int i = 0, j = strlen (SS); i < j; SS[i++] -= '0') ;
printf ("%s\n", solve (SS, strlen (SS))) ;
}
}