Go: package main

import "fmt"

func main() {
	stack := []int{}
	for {
		var a int
		i, _ := fmt.Scan(&a)
		if i == 0 {
			break
		}
		if a == 0 {
			fmt.Println(stack[len(stack)-1])
			stack = stack[:len(stack)-1]
			continue
		}
		stack = append(stack, a)
	}
}

C++: #include<iostream>

using namespace std;

int main() {
	int train[11] = { 0 }, junban[11] = { 0 }, a = 0, n, i;	
	while (cin >> n) {
		if (n == 0) {
			for (i = 0; train[i] != 0; i++) {;}
			junban[a] = train[i - 1];
			train[i - 1] = 0;
			a++;
		}
		else {
			for (i = 0; train[i] != 0; i++) {;}
			train[i] = n;
		}
	}
	for (i = 0; junban[i] > 0; i++) {
		cout << junban[i] << endl;
	}
	return 0;
}

C++: #include<stdio.h>
const int SIZE=100;
int data[SIZE];
int sp=0;
int size(){
  return sp;
}
int empty(){
  return sp<=0;
}
int top(){
  return data[sp-1];
}
void pop(){
  sp--;
}
void push(int v){
  data[sp]=v;
  sp++;
}
int main(){
  int n,k;
  while(1){
    scanf("%d",&n);
    if(n==0){
      printf("%d\n",top());
      pop();
    }else{
      push(n);
    }
    if(n==empty)break;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i, n) for(int i = 0; i < n; i++){
const int INF = 1 << 25;
 
stack<int> cars;
int numbar;
 
int main(){
    while(scanf("%d", &numbar) != EOF){
        if(numbar == 0){
            printf("%d\n", cars.top());
            cars.pop();
            continue;
        }
        cars.push(numbar);
    }
    return 0;
}

C++: #include <iostream>
#include <stdlib.h>

using namespace std;

int main(int argc, char **argv)
{
	int n, p = 1, *a = (int *)calloc(11, sizeof(int));
	
	while(cin >> n){
		if(n == 0){
			p--;
			cout << a[p] << endl;
		} else {
			a[p] = n;
			p++;
		}
	}
	
	free(a);
	return 0;
}

C++: #include <iostream>
#include <stack>
using namespace std;
int main()
{
    int n;
    stack<int> cs;
    while(cin>>n)
    {
        if(n>0)cs.push(n);
        else{
            cout<<cs.top()<<endl;
            cs.pop();
        }
    }
}

C++: #include <stdio.h>
const int SIZE = 100;
int data[SIZE];
int sp= 0;

int size(){
 return sp;
}

int top(){ return data[sp-1];
}
void pop(){
 sp--;
}

void push(int v){
 data[sp] = v;
 sp++;
}

int main(){
 int v;
 while(scanf("%d", &v)) != EOF){
  if(v != 0){
    push(v);
  }
  if(v == 0){
   pop();
  }
  top();
 }
}

C++: #include<stdio.h>
const int SIZE=100;
int data[SIZE];
int sp=0;
int size(){
  return sp;
}
int empty(){
  return sp<=0;
}
int top(){
  return data[sp-1];
}
void pop(){
  sp--;
}
void push(int v){
  data[sp]=v;
  sp++;
}
int main(){
  int n,k;
  while(scanf("%d",&n)!=EOF){
    if(n==0){
      printf("%d\n",top());
      pop();
    }else{
      push(n);
    }
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int in,i = 0,syako[1000];
    while(cin >> in){
        if(in != 0){
            syako[i] = in;
            i++;
        }
        else{
            cout << syako[i - 1] << endl;
            i--;
        }
    }
}

C++: #include<iostream>
#include<cstdio>
#include<stack>
using namespace std;

stack<int> sta;

int main(void)
{
  int a;
  while(1){
    cin>>a;
    if(a)
      sta.push(a);
    else{
      cout<<sta.top()<<endl;
      sta.pop();
    }
  }
  return 0;

}

C++: #include <iostream>
#include <vector>

using namespace std;

int main(){
	vector<int> a;
	for(int n; cin >> n;){
		if(!n) cout << a[a.size() - 1] << endl, a.pop_back();
		else a.push_back(n);
	}
	return 0;
}

C++: #include<stdio.h>
int main(){
  int sp=0,data[100],n,i;
  for(i=0;i<100;i++){
    scanf("%d",&n);
    if(n==0){
      sp--;
      printf("%d\n",data[sp]);
    }else{
      data[sp]=n;
      sp++;
    }
  }
}

C++: #include <iostream>
using namespace std;

int main(){
	int out[10], car[10] = {0};
	int x, k = 0, i = 0;
	while(cin >> x){
		if(x != 0){
			car[i] = x;
		}
		else{
			out[k] = car[i-1];
			i = i-2;
			k++;
		}
		i++;
	}
	for(int j = 0; j < k; j++){
		cout << out[j] << endl;
	}
}

C++: #include <iostream>
#include <vector>
using namespace std;

int main() {
	int n;
	vector<int> train;
	
	while (cin >> n) {
		if (n != 0) {
			train.push_back(n);
		}
		else {
			cout << train.back() << endl;
			train.pop_back();
		}
	}

	return 0;
}

C++: #include<stdio.h>

int main()
{
	int x[100]={0},y[100]={0},z,n,t=0,r=0;
	while(scanf("%d",&n) !=EOF)
	{
		if(n>=1)
		{
			x[t]=n;
			t++;
		}
		else if(n==0)
		{
			t--;
			y[r]=x[t];
			r++;
		}
	}
	
	for(z=0;z<r;z++)
	{
		printf("%d\n",y[z]);
	}
	return 0;
}

C++: #include <iostream>
#include <deque>

int main(){
	std::deque<int> que;
	int tmp;
	while(std::cin >> tmp){
		if(tmp == 0) std::cout << que.pop() << std::endl;
		else que.push(tmp);
	}
		return 0;
	}

C++: #include <iostream>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    int st[100];
    int sn=0;
    while(cin>>t){
        if(t==0) cout<<st[--sn]<<'\n';
        else st[sn++]=t;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
  int n, i = 0;
  int car[10] = {};
  while(cin >> n){
    if(n == 0){
      cout << car[i - 1] << endl;
      car[i - 1] = 0;
      i--;
    }else{
      car[i] = n;
      i++;
    }
  }
}

C++: #include <stdio.h>

int main()
{
int p[10]={};
int x,i;
i=0;x=0;
while(scanf("%d",&x)!=EOF)
{
if(x%10>0){p[i]=x;i++;}
else{i--;printf("%d\n",p[i]);}

}
return 0;
}

C++:     #include <iostream>
    #include <stack>
    #include <vector>
     
    int main() {
    int n;
    std::stack<int> stc;
    std::vector<int> ans;
     
    while (std::cin >> n) {
    if (n == 0) {
    ans.push_back(stc.top());
    stc.pop();
    } else {
    stc.push(n);
    }
    }
     
    for (auto n : ans) {
    std::cout << n << std::endl;
    }
    }

C++: #include<iostream>
#include<vector>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<stack>

using namespace::std;


int main(){

  stack<int> st;
  int val = 0;
  int ans[1000] = {};
  int i = 0;
  int j = 0;

  scanf("%d", &val);
  st.push(val);

  while(!st.empty()){
    scanf("%d", &val);
    if(val == 0){
     ans[i] = st.top();
     i++;
     st.pop();
     continue;
    }
    st.push(val);
  }

  for(j = 0; j < i; j++){
    printf("%d\n", ans[j]);
  }


  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int i=0,num,a[10],b[10],x=0;
  
  while(cin>>num){
    int count=0;
    count++;
    if(num==0){
      b[x++]=a[i-1];
      i--;
    }
    else  a[i++]=num;
  }

  for(i=0;i<x;i++)
    cout<<b[i]<<endl;
  return 0;
}

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


int main(){
	li p;
	stack<li> stk;
	
	while(cin>>p){
		if(p>0)stk.push(p);
		else{
			cout<<stk.top()<<endl;
			stk.pop();
		}
	}
	
	return 0;
}

C++: #include <iostream>
#include <stack>

using namespace std;

int main(){
	int n;
	stack<int> st;
	
	while(cin>>n){
		if(n==0){
			cout<<st.top()<<endl;
			st.pop();
		}else{
			st.push(n);
		}
	}

	return 0;
}

C++: #include <iostream>
#include <stack>

int main()
{
	std::stack<int> st;
	int n;

	while (std::cin >> n)
	{
		if (n == 0)
		{
			std::cout << st.top() << std::endl;
			st.pop();
		}
		else
		{
			st.push(n);
		}
	}

}