Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

type Railway struct {
	trains trains
}

type trains []int

func main() {
	var stdin string
	var s = bufio.NewScanner(os.Stdin)

	railway := Railway{}
	for s.Scan() {
		stdin = s.Text()

		n, err := strconv.Atoi(stdin)
		if err != nil {
			continue
		}
		railway.lifo(n)
	}
}

func (r *Railway) lifo(n int) {
	if n == 0 {
		if len(r.trains) == 0 {
			return
		}
		fmt.Println(r.trains[len(r.trains)-1])
		r.trains = r.trains[:len(r.trains)-1]
	} else {
		r.trains = append(r.trains, n)
	}
}

C++: #include<stdio.h>
int main(){
  int n,m,i=0,j=0,h=0;
  int data[20];
  int str[10];
  while(scanf("%d",&n)!=EOF){
    data[i]=n;
    if(n==0){
      j=i;
      while(data[i-1]==0){
	i--;
      }
      str[h]=data[i-1];
      data[i-1]=0;
      i=j;
      j=0;
      h++;
    }
    i++;
  }
  for(i=0;i<h;i++){
    printf("%d\n",str[i]);
  }
  return(0);
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<math.h>
using namespace std;

int main()
{
	
	vector<int>a;
	vector<int>b;
	vector<int>c;
	int s[20];
while(true)
{
for(int i=0;i<20;i++)
{
	cin>>s[i];

if(s[i]==0)
	{
		b.push_back(s[i]);
		a.push_back(c.back());
		c.pop_back();
		if(c.size()==0)
		{
		break;
		}
	}
	else
	{
		c.push_back(s[i]);
	}
	
}
for(int j=0;j<a.size();j++)cout<<a[j]<<endl;
	}
return 0;
}

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

int main(void) {

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

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


int main(){

  int train[20] , num[20];

 for( int i = 0; i < 20; i++ ){
    train[i] = 0;
    num[i] = 0;
 }

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

    cin >> train[i];

    if( train[i] == 0 ){
      for( int j = i; j >= 0; j-- ){
	if( train[j] != 0 ){
	num[i] = train[j];
	train[j] = 0;
	break;
	}
      }
    }
  }
  
  cout << endl;
  for( int k = 0; k < 20; k++ ){
    if( num[k] != 0 ) cout  << num[k] << endl; 

  }


  return 0;
}

C++: /*AOJ 0013*/

#include<iostream>
#include<stack>
#include<queue>

using namespace std;

int main(){

	stack<int> data;
	queue<int> ans;

	int tmp;

	cin>>tmp;

	data.push(tmp);

	int flag = 0;
	for(;;){

		flag = 0;

		cin>>tmp;

		if(tmp == 0){
			ans.push(data.top());
			data.pop();
			if(data.size()==0){
				flag = 1;
			}
		}
		else{
			data.push(tmp);
		}

		if(flag == 1){
			break;
		}
	}
	while(ans.size()!=0){
		cout<<ans.front()<<endl;
		ans.pop();
	}

	return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<memory>
#include<array>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>

using namespace std;

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

  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<u_int> train;
    u_int num;
    while(std::cin >> num){
        if(num == 0){
            std::cout << train.top() << std::endl;
            train.pop();
        }
        else {
            train.push(num);
        }
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
	vector<int> a(100);
	int b;
	int i=0;
	while(cin>>b){
		if(b!=0){
			a[i]=b;
			i++;
		}
		else if(b==0){
			cout<<a.at(i-1)<<endl;
			a.erase(a.begin()+i-1);
			i--;
		}
	}
	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==EOF)break;
  }
  return 0;
}

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

using namespace std;

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

C++: #define _CRT_SECURE_NO_WARNINGS

#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>

using namespace std;


int main(int argc, char **argv)
{
	int n;
	stack<int> rail;
	while (cin >> n) {
		if (n != 0) {
			rail.push(n);
		} else {
			cout << rail.top() << endl;
			rail.pop();
		}
	}
}

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

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

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

int main() {
    vector<int> v;
    int num;
    while(cin) {
        cin >> num;
        if(num != 0) v.push_back(num);
        else {
            cout << v[v.size()-1] << endl;
            v.pop_back();
        }
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <iterator>

static int createListOfInputData(std::vector<int>& vec);
static int switchingRailroadCars(std::vector<int>& vec, std::vector<int>& data);
static void showData(std::vector<int>& vec);

int main()
{
    std::vector<int> v;
    std::vector<int> r;

    if (createListOfInputData(v)) {
        std::cout << "Failure";
        exit (8);
    }

    if (switchingRailroadCars(v, r)) {
        std::cout << "Failure";
        exit (8);
    }

    showData(r);

    return 0;
}

static int createListOfInputData(std::vector<int>& vec)
{
    int t = 0;

    if ( 0x00 == &vec ) {
        return 1;
    }

    while (std::cin >> t) {
        if ( 100 < t ) {
            return 1;
        }
        vec.push_back(t);
    }

    return 0;
}

static int switchingRailroadCars(std::vector<int>& vec, std::vector<int>& data)
{
    std::vector<int>::iterator it;

    if ( 0x00 == &vec ) {
        return 1;
    }

    it = vec.begin();

    while (vec.end() != it) {
        if ( 0 == *it ) {
            data.push_back(*(it - 1));
            vec.erase(it);
            it = vec.erase(it - 1);
        } else {
            it++;
        }
    }

    return 0;
}

static void showData(std::vector<int>& vec)
{
    if ( 0x00 == &vec ) {
        return;
    }

    for ( unsigned int i = 0; i < vec.size(); i++ ) {
        std::cout << vec.at(i) << std::endl;
    }
}

C++: //外積を使う

#include<iostream>
#include<string>
#include<stdio.h>
#include<vector>

using namespace std;


int main(){
	
	vector<int> stack;

	int i = 0;
	int ret;

	while (scanf("%d", &ret) != EOF){
		if (ret != 0){
			stack.push_back(ret);
		}
		else{
			cout << stack[stack.size()-1]<< endl;
			stack.pop_back();
		}
	}


	return 0;
}

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

int main()
{
	stack<int> s;
	deque<int> ans;
	int n;

	while (cin >> n)
	{
		if (cin.eof()) return 0;
		if (n == 0)
		{
			ans.push_front(s.top());
			s.pop();
			if (s.empty()) break;
		}
		else
		{
			s.push(n);
		}
	}

	while (1)
	{
		if (!ans.empty())
		{
			cout << ans.back() << endl;
			ans.pop_back();
		}
		else break;
	}
	return 0;
}

C++: #include <iostream>
  
struct Stack{
  int data[100000];
  int idx;
  Stack():idx(0){}
  void push(int val){ data[idx++]=val;}
  int pop(){ return data[--idx];}
};

int main(){
  Stack s;
  int val;
  while(std::cin>>val){
    if(val==0)
      std::cout<<s.pop()<<std::endl;
    else
      s.push(val);
  }
  return 0;
}