Cod sursa(job #783541)
Utilizator | Data | 3 septembrie 2012 10:47:53 | |
---|---|---|---|
Problema | Nivele | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
#include<stack>
#include<algorithm>
using namespace std;
ifstream f("nivele.in");
ofstream g("nivele.out");
int n,t,a,i;
int main (){
f>>t;
while(t){
f>>n;
stack<int>S;
for(i=1;i<=n;i++){
f>>a;
while(!S.empty() && S.top()== a ){
S.pop();--a;
}
S.push(a);
}
if(S.size()==1 && S.top()==1)
g<<"DA\n";
else
g<<"NU\n";
--t;
}
return 0;
}