#include <iostream>#include <stack>#include <cstdio>using namespace std;// stackint main(){          int num;         stack<int> List;        while(scanf("%d", &num) && num !=-1){              List.push(num);          }          while(!List.empty()){           printf("%d\n", List.top());           List.pop();         }        return 0;} /**************************************************************    Problem: 1511    User: qiu0130    Language: C++    Result: Accepted    Time:80 ms    Memory:1916 kb****************************************************************/#include <stdio.h>#include <stdlib.h>#include <malloc.h>typedef struct Lnode{    int data;    struct Lnode *next; }Lnode; // 头插法int main(){         int num;        Lnode *List = (Lnode *)malloc(sizeof(Lnode));          List->data = http://www.mamicode.com/0;          List->next=NULL;        while(scanf("%d", &num)&&num!=-1){                   Lnode *p= (Lnode *)malloc(sizeof(Lnode));                   p->data =http://www.mamicode.com/ num;                   p->next = List->next;                   List->next = p;           }           Lnode *p = List->next;           while(p != NULL){             printf("%d\n", p->data);                 p=p->next;            }        return 0;} /**************************************************************    Problem: 1511    User: qiu0130    Language: C    Result: Accepted    Time:90 ms    Memory:3948 kb****************************************************************/