algo_stack_pointers

#include <iostream>
using namespace std;
typedef struct Element *po;

struct Element{
    int data;
    po next;
};
/*
void rStackAdd(int inp, po obj){
    if(obj->next != NULL) rStackAdd(inp, obj->next);
    obj->data = inp;
    obj->next = new Element;
    obj->next = NULL;
}

void rStackPrint(po obj){
    if(obj->next != NULL) {
        cout << obj->data << endl;
        rStackPrint(obj->next);
    }
    //cout << obj->data << endl;
}
*/

void main(){
    po na, p;
    na = new Element;
    na = NULL;
    int input;
    while(cin>>input){
        if(input == 99) break;
        p = new Element;
        p->data = input;
        p->next = na;
        na = p;
    //  rStackAdd(input, na);
    }
    //rStackPrint(na);
    /*
    na = new Element;
    na->data = 13;
    na->next = new Element;
    na->next->data = 14;
    na->next->next = new Element;
    */
}