#include <iostream>
using namespace std;
class Stack {
public:
int size;
long long arr[100];
long long capacity;
};
void pop(Stack *s)
{
if(s->size==0) {
return;
}
s->size--;
}
void push(Stack *s,int x) {
s->capacity>s->size?s->capacity:s->capacity*2;
s->arr[s->size]=x;
s->size++;
}
int main(int argc, char** argv) {
Stack *s=(Stack*)malloc(sizeof(Stack));
int n;
cin>>n;
for(int i=0; i<n; i++) {
int x;
cin>>x;
push(s,x);
}
while(s->size) {
cout<<s->arr[s->size-1]<<" ";
pop(s);
}
return 0;
#include <iostream>
using namespace std;
class Stack {
public:
int size;
long long arr[100];
long long capacity;
};
void pop(Stack *s)
{
if(s->size==0) {
return;
}
s->size--;
}
void push(Stack *s,int x) {
s->capacity>s->size?s->capacity:s->capacity*2;
s->arr[s->size]=x;
s->size++;
}
int main(int argc, char** argv) {
Stack *s=(Stack*)malloc(sizeof(Stack));
int n;
cin>>n;
for(int i=0; i<n; i++) {
int x;
cin>>x;
push(s,x);
}
while(s->size) {
cout<<s->arr[s->size-1]<<" ";
pop(s);
}
return 0;
}