Pagini recente » Cod sursa (job #2351643) | Monitorul de evaluare | Cod sursa (job #1512428) | Cod sursa (job #676685) | Cod sursa (job #1812411)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nim.in");
ofstream out("nim.out");
const int maxn = 10005;
int v[maxn];
void solve()
{
int n;
in >> n;
int s = 0;
for(int i = 1; i <= n; i++)
{
in >> v[i];
s += v[i];
}
for(int i = 1; i <= n; i++)
{
int p = s ^ v[i];
if(p < v[i])
{
out << "DA" << "\n";
return;
}
}
out << "NU" << "\n";
}
int main()
{
int T;
in >> T;
for(int i = 1; i <= T; i++)
solve();
return 0;
}