Cod sursa(job #2300691)
| Utilizator | Data | 11 decembrie 2018 21:14:30 | |
|---|---|---|---|
| Problema | Jocul NIM | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <cstdio>
#define MAXN 10000
using namespace std;
int v[MAXN+5];
int main()
{
freopen( "nim.in", "r", stdin );
freopen( "nim.out", "w", stdout );
int t;
scanf( "%d", &t );
while( t )
{
int n, sumxor=0;
scanf( "%d", &n );
for( int i=1;i<=n;i++ )
{
scanf( "%d", &v[i] );
sumxor^=v[i];
}
if( sumxor==0 )
printf( "NU\n" );
else
{
int ok=0;
for( int i=1;i<=n && !ok;i++ )
ok=(sumxor^v[i]<=v[i]);
if( ok )
printf( "DA\n" );
else
printf( "NU\n" );
}
t--;
}
return 0;
}
