PILHAS em C++

// StackTopEmpty.cpp
// compile with: /EHsc
// Illustrates how to use the top function to
// retrieve the last element of the controlled
// sequence. It also illustrates how to use the
// empty function to loop though the stack.
// 
// Functions:
//
//    top   :  returns the top element of the stack.
//    empty :  returns true if the stack has 0 elements.
//////////////////////////////////////////////////////////////////////

#pragma warning(disable:4786)
#include <stack>
#include <iostream>

using namespace std ;

typedef stack<int> STACK_INT;

int main()
{
   STACK_INT stack1;

   cout &lt&lt "stack1.empty() returned " &lt&lt
      (stack1.empty()? "true": "false") &lt&lt endl;  // Function 3

   cout &lt&lt "stack1.push(2)" &lt&lt endl;
   stack1.push(2);

   if (!stack1.empty())                           // Function 3
      cout &lt&lt "stack1.top() returned " &lt&lt
      stack1.top() &lt&lt endl;                       // Function 1

   cout &lt&lt "stack1.push(5)" &lt&lt endl;
   stack1.push(5);

   if (!stack1.empty())                           // Function 3
      cout &lt&lt "stack1.top() returned " &lt&lt
      stack1.top() &lt&lt endl;                       // Function 1

   cout &lt&lt "stack1.push(11)" &lt&lt endl;
   stack1.push(11);

   if (!stack1.empty())                           // Function 3
      cout &lt&lt "stack1.top() returned " &lt&lt
      stack1.top() &lt&lt endl;                       // Function 1

   // Modify the top item. Set it to 6.
   if (!stack1.empty()) {                         // Function 3
      cout &lt&lt "stack1.top()=6;" &lt&lt endl;
      stack1.top()=6;                             // Function 1
   }

   // Repeat until stack is empty
   while (!stack1.empty()) {                      // Function 3
      const int& t=stack1.top();                  // Function 2
      cout &lt&lt "stack1.top() returned " &lt&lt t &lt&lt endl;
      cout &lt&lt "stack1.pop()" &lt&lt endl;
      stack1.pop();
   }
}