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>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>

#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)


using namespace std;


int main(void)
{
    int a[101][2] ={0};
    int i = 0,j = 0,k = 0,l = 0;
    int answer[100] = {0};
    bool judge = true;
    int tempjudge = 0;
    
    while(judge)
    {
        cin >> a[i][0];
        if(a[i][0] == 0)
        {
            a[i][1] = 1;
            RFOR(j,i,-1)
                if(a[j][1] != 1 )
                {
                    answer[l] = a[j][0];
                    a[j][1] = 1;
                    l++;
                    break;
                }
        }
        REP(k,i+1)
        if(a[k][1] != 1){
                judge = true;
                break;
        }
        else
            judge = false;
                
        
        i++;
    }
    REP(m,l)
    cout << answer[m] << 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==EOF)break;
    if(n==0){
      printf("%d\n",top());
      pop();
    }else{
      push(n);
    }
  }
  return 0;
}

C++: #include <stdio.h>
#include <stack>

int main() {
  int i;
  int cnt = 0;
  std::stack<int> st;
  while(cnt < 50) {
    scanf("%d", &i);
    if(i == 0){
      printf("%d\n", st.top());
      st.pop();
    }else{
      st.push(i);
    }
    cnt++;
  }
  return 0;
}

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

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

int main(){
  stack<int> s;
  int num;
  while(cin>>num){
    if(num!=0){
      s.push(num);
    }
    else{
      cout<<s.top()<<endl;
      s.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>
using namespace std;
int n;
stack<int>st;
int main(){
  while(cin>>n){
    if(n==0){
      cout<<st.top()<<endl;
      st.pop();
    }else{
      st.push(n);
    }    
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    stack <int> st;
    while(cin>>n){
            if(n==0){
                if(st.empty()){
                    continue;
                }
                cout<<st.top()<<endl;
                st.pop();
            }
            else{
                st.push(n);

            }

    }


    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define M_PI 3.14159265358979
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include <algorithm>

using namespace std;

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

C++: #include<bits/stdc++.h>
using namespace std;

string str1[11],str2[11],mo;

int  s=1,t1,t2;

int main(){


    while(1){

    cin >> mo;


    if(mo!="0"){
        str1[t1]=mo;
        t1++;

    }else {
        str2[t2++]=str1[--t1];

    }

    if(t1==0)break;

    }

    for(int i=0;i<11;i++){

            if(str2[i]=="0")break;
        cout << str2[i] << endl;
    }


return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

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

C++: #include <stdio.h>

int main(void)
{
	int num[10];
	int in;
	int ord[10];
	int i;
	
	for (i = 0; i < 10; i++){
		num[i] = 0;
	}
	while (scanf("%d", &in) == 1){
		if (in != 0){
			for (i = 0; i < 10; i++){
				if (!num[i]){
					num[i] = in;
					break;
				}
			}
		}
		else {
			for (i = 9; i >= 0; i--){
				if (num[i] != 0){
					printf("%d\n", num[i]);
					num[i] = 0;
					break;
				}
			}
		}
	}
	
	return (0);
}

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

using namespace std;       
int main(){
  stack<int> s;
  int a;
  while(cin >> a){
    if(a != 0){
      s.push(a);
    }else{
      cout << s.top()<< endl;
      s.pop();
    }
    if(s.size() == 0)
      break;
  }
  return 0;
}

C++: #include <stdio.h>

int train[10];
int sp = 0;

int empty() {
  return sp <= 0;
}

int size() {
  return sp;
}

int top() {
  return train[sp-1];
}

void pop() {
  sp--;
}

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

int main(){
  int num;
  while(1){
    scanf("%d", &num);
    if(num == 0){
      printf("%d\n", top());
      pop();
    }else if(1 <= num && num <= 10){
      push(num);
    }
    if(size() == 0) 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 <stack>
 
using namespace std;
 
int main(){
  stack<int> trains;
  int p;
  while(cin >> p){
    if(p == 0){
      cout << trains.top() << endl;
      trains.pop();
    }else{
      trains.push(p);
    }
  }
  return 0;
}

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

int main(){
  stack<int> st;
  int a;
  while(cin>>a){
    if(a)st.push(a);
    else {printf("%d\n",st.top());
      st.pop();
    }
}

   
  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
    vector<int> t;
    int a;
    while (true)
    {
        cin >> a;
        if (a != 0)
        {
            t.push_back(a);
        }
        else if (a == 0)
        {
            cout << t.back() << endl;
            t.pop_back();
        }
        if (t.empty())
        {
            break;
        }
    }
}

C++: #include<iostream>
#include<vector>
int main()
{
	std::vector<int>num;
	for (int i; std::cin >> i;)
	{
		if (i == 0)
		{
			std::cout << num.back() << std::endl;
			num.pop_back();
		}
		else
		{
			num.push_back(i);
		}
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

double dot(P a,P b){return real(conj(a)*b);};
double cross(P a,P b){return imag(conj(a)*b);};

int main(){
  stack<int> st;
  int x;
  while(~scanf("%d",&x)){
    if(x == 0){
      cout<<st.top()<<endl;
      st.pop();
    }else{
      st.push(x);
    }
  }
  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_back() << std::endl;
		else que.push_back(tmp);
	}
		return 0;
	}