лист 31

#include <iostream>
using namespace std;

 struct ListElem
{
   int value;
   ListElem *next;
};

class List
{
   ListElem *pbeg, *pend;
   int Size = 0;
public:
   List()
    {
     pend = pbeg = NULL;
    }
   int get_Size()
   {
     return Size;
   }
   void push_front(int val);
   int pop_front();
};

void List::push_front(int val)
{
   ListElem *pnew = new ListElem;
   pnew->value = val;
   pnew->next = pbeg;
   pbeg = pnew;
   if (!pend)
     pend = pnew;
  Size++;
}

int List::pop_front()
{
   if (!pbeg) return -1;
   ListElem *ptr = pbeg;
   int val = pbeg->value;
   pbeg = pbeg->next;
   if (!pbeg) pend = NULL;
   delete ptr; return val;
}

int main ()
{
   List lst;
  int number, n;
  cin >> n;

  for (int i = 0; i < n ; i++)
    {
      cin >> number;
      lst.push_front(number);
    }


  for (int i = 0; i < lst.get_Size(); i++)
   cout << lst.pop_front() << " ";
}