Cod sursa(job #2700948)
Utilizator | Data | 29 ianuarie 2021 12:53:39 | |
---|---|---|---|
Problema | Nivele | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("nivele.in");
ofstream g("nivele.out");
int q,n,k,v[100001];
int main()
{
f>>q;
for(int i=1; i<=q; i++)
{
f>>n;
k=0;
for(int j=1; j<=n; j++)
{
f>>v[++k];
if(v[k]==v[k-1])
{
while(v[k]==v[k-1])
{
v[k]=0;
v[k-1]--;
k--;
}
}
}
if(k==1 and v[k]==1)g<<"DA"<<'\n';
else g<<"NU"<<'\n';
}
return 0;
}