Cod sursa(job #693944)
Utilizator | Cantor Paul Dan Cantor_paul | Data | 27 februarie 2012 17:49:12 |
---|---|---|---|
Problema | Nivele | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("nivele.in");
ofstream g("nivele.out");
int N, T, S[50001];
char *P[3];
void second()
{
f >> N;
S[0] = 0;
for (int i = 1; i <= N; i++)
{
f >> S[++S[0]];
while (S[0] > 1 && S[S[0]] == S[S[0]-1])
S[--S[0]]--;
}
if (S[0] == 1 && S[1] == 1)
*P = "DA\n";
else
*P = "NU\n";
g << *P;
}
int main()
{
f >> T;
while (T--)
second();
return 0;
}