Cod sursa(job #982179)
| Utilizator | Data | 8 august 2013 19:14:03 | |
|---|---|---|---|
| Problema | Nivele | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
#include <stack>
#include <vector>
using namespace std;
ifstream f("nivele.in");
ofstream g("nivele.out");
int T,n;
stack<int> S;
int main(void){
register int i,j,x;
f>>T;
for(;T>0;T--){
f>>n;
for(i=1;i<=n;i++){
f>>x;
while(!S.empty() && x==S.top()){
S.pop();
x--;
}
S.push(x);
}
if(S.top()==1){
S.pop();
if(S.empty())
g<<"DA\n";
else
g<<"NU\n";
}
else{
g<<"NU\n";
}
while(!S.empty())
S.pop();
}
return 0;
}
