Cod sursa(job #139867)
Utilizator | Andrei Purice Protoman | Data | 20 februarie 2008 20:38:25 |
---|---|---|---|
Problema | Nivele | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
long i,j,g,t,n;
long a[50010];
int main()
{
freopen("nivele.in","r",stdin);
freopen("nivele.out","w",stdout);
scanf("%ld",&t);
for (g=0;g<t;g++)
{
scanf("%ld",&n);
for (i=1, j=1;i<=n;i++, j++)
{
scanf("%ld",&a[j]);
while (a[j]==a[j-1])
{
a[j-1]=a[j]-1;
a[j]=0;
j--;
}
}
j--;
if (j==1 && a[j]==1)
printf("DA\n");
else printf("NU\n");
}
fclose(stdin);
fclose(stdout);
return 0;
}