Cod sursa(job #3124682)
Utilizator | Data | 29 aprilie 2023 20:16:24 | |
---|---|---|---|
Problema | Nivele | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nivele.in");
ofstream fout("nivele.out");
int q, n, s[50002], top, i;
int main() {
fin >> q;
while(q--) {
fin >> n;
for(i = 1; i <= n; i++) {
fin >> s[++top];
while(s[top - 1] == s[top]) {
s[top] = 0;
s[--top]--;
}
}
if(top == 1 && s[1] == 1) fout << "DA\n";
else fout << "NU\n";
}
return 0;
}