Cod sursa(job #2041683)
Utilizator | Data | 17 octombrie 2017 18:08:39 | |
---|---|---|---|
Problema | Nivele | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream f("nivele.in");
ofstream g("nivele.out");
int test, a[100001], k, n, x;
int main()
{
f>>test;
for(;test>0;test--)
{
f>>n;
k=0;
for(;n>0;n--)
{
f>>x;
a[++k]=x;
while(a[k-1]==a[k] && k>=2)
a[--k]=a[k]-1;
}
if (k==1 && a[1]==1)
g<<"DA\n";
else g<<"NU\n";
}
return 0;
}