int A[5];

// Stack using OOD
#include <iostream>
#include <stdlib.h>

using namespace std;

class Stack
{
private:
	enum { MAX=10,MIN=-1};  // MAXIMUM,MINIMUM STACK CONTENT
	int array[MAX]; // Contains all the Data
	int top;  //Contains location of Top most Data pushed onto Stack
public:
	Stack();

	void push(int); // push number to array
	int pop();    // pop it from array

	bool isEmpty();  // check if array is Empty!
	bool isFull();	// check if it full
	
};

Stack::Stack():
top(MIN)
{}

bool Stack::isEmpty()
{
	if(top == MIN)
		return true;
	else
		return false;
}

bool Stack::isFull()
{
	if(top == MAX -1)
		return true;
	else
		return false;
}

void Stack::push(int i)
{
	if(isFull())
	{
		cout<<"\nArray is Full";
		exit(1);
	}

	else
	{
		++top;
		array[top]=i;
	}

}


int Stack::pop()
{
	int number;

	if(isEmpty())
	{
		cout<<"\nArray is Empty";
		exit(1);
	}

	else
	{
		number=array[top];
		top--;
		
	}
	
	return number;

}

int main()
{
	Stack s;

	// push numbers 2,4,8
	s.push(2);
	cout<<"\n2 is pushed\n";
	s.push(4);
	cout<<"\n4 is pushed\n";
	s.push(8);
	cout<<"\n8 is pushed\n";

	// pop numbers
	cout<<"\n"<<s.pop()<<" is poped"<<endl;
	cout<<s.pop()<<" is poped"<<endl;
	cout<<s.pop()<<" is poped"<<endl;
	return 0;
}

// Stack using C Language
#include <stdio.h>
#include <stdlib.h>

#define MAX 10
#define MIN -1


struct Stack
{
	int array[MAX];
	int top;
};

void push(Stack *,int);
int pop(Stack *);
void initializeStack(Stack *);

int main()
{
	Stack s;
	initializeStack(&s);

	push(&s,2);
	printf("\n2 is pushed\n");
	push(&s,4);
	printf("\n4 is pushed\n");
	push(&s,8);
	printf("\n8 is pushed\n");

	// pop numbers
	printf("\n %d is pushed\n",pop(&s));
	printf("\n %d is pushed\n",pop(&s));
	printf("\n %d is pushed\n",pop(&s));
	return 0;
}


void initializeStack(Stack *s)
{
	(*s).top=MIN;
}
void push(Stack *s,int number)
{
	if( (*s).top == MAX -1 )
	{
		printf("\nArray is Full");
		exit(1);
	}
 
	(*s).top+=1;
	(*s).array[(*s).top]=number;
}

int pop(Stack *s)
{
	if( (*s).top == MIN )
	{
		printf("\nArray is Empty");
		exit(1);
	}

	int n=(*s).array[(*s).top];
	(*s).top--;
	return n;
}

 int array[10];
for(int i=0;i<10;i++)
 array[i]=i*2+1;

for(int i=9;i>=0;i--)
 cout<<array[i];

push(7);

int var=pop();

- int main()
2- {
3-	Stack s;

4-	// push numbers 2,4,8
5-	s.push(2);
6-	cout<<"\n2 is pushed\n";
7-	s.push(4);
8-	cout<<"\n4 is pushed\n";
9-	s.push(8);
10-	cout<<"\n8 is pushed\n";

11-	// pop numbers
12-	cout<<"\n"<<s.pop()<<" is poped"<<endl;
13-	cout<<s.pop()<<" is poped"<<endl;
14-	cout<<s.pop()<<" is poped"<<endl;
15-	return 0;
16- }

push(int i)
{
	if(isFull())
	{
		cout<<"\nArray is Full";
		exit(1);
	}

	else
	{
		++top;
		array[top]=i;
	}

}

while(there is no new lesson)
{
	cout<<"المكدس هو مصفوفة + دليل ";
}

pop()
{
	int number;

	if(isEmpty())
	{
		cout<<"\nArray is Empty";
		exit(1);
	}

	else
	{
		number=array[top];
		top--;
		
	}
	
	return number;

}

number=array[top];

number=array[2];

Stack s;
s.push(10);
s.push(20);
s.pop();
s.push(30);

// Stack v0.1 using OOD
#include <iostream>
#include <stdlib.h>
using namespace std;

class Stack
{
private:
	enum { MAX=10,MIN=-1};// MAXIMUM,MINIMUM STACK CONTENT	
	int *pArray; // pointer to array.
	int top;  //Contains location of Top most Data pushed onto Stack
	int size; // contain the number of item(integer) you want

public:
	Stack(int n=MAX);
	~Stack();
	void push(int); // push number to array
	int pop();    // pop it from array
	bool isEmpty();  // check if array is Empty!
			bool isFull();	// check if it full

};

Stack::Stack(int n):
top(MIN),size(n)
{
	pArray=new int[n];	
}

Stack::~Stack()
{
	delete pArray;
	pArray=0;
}


bool Stack::isEmpty()
{
	return (top==MIN?ture:false);
}

bool Stack::isFull()
{
	return (top==size -1 ?ture:false);
}


void Stack::push(int i)
{
	if(isFull())
	{
		cout<<"\nArray is Full";
		exit(1);
	}
	
	else
	{	
		++top;
		*(pArray+top)=i;
		// or use this : pArray[top]=i;
	}
}


int Stack::pop()
{	
	int number;
	if(isEmpty())
	{
		cout<<"\nArray is Empty";
		exit(1);
	}	
	
	else
	{		
		number=pArray[top];
		//or use this: number=*(pArray+top);
		top--;		
           }
	return number;

}


int main()
{
	int number;
	cout<<"\nEnter The Number you want\n\t\t>> ";
	cin>>number;

	Stack s(number);

	// push numbers 2,4,8
	s.push(2);
	cout<<"\n2 is pushed\n";
	s.push(4);
	cout<<"\n4 is pushed\n";	
	s.push(8);
	cout<<"\n8 is pushed\n";

	// pop numbers
	cout<<"\n"<<s.pop()<<" is poped"<<endl;
			cout<<s.pop()<<" is poped"<<endl;
			cout<<s.pop()<<" is poped"<<endl;
	return 0;
}

array[10];

pArray=new int[x];

int x=2;
if(x==3)
int a=new int;

int x=2;
if(x==3)
int a;

int main()
{
	int x=2;

	{
		int y=4;
	}

	cout<<x;
	cout<<y;
	
return 0;
}

int main()
{
	int x=2;
	int *y;
	{
		y=new int;
		*y=4;
	}

	cout<<x;
	cout<<*y;
	delete y;
	
return 0;
}

int *y=new int;

int main()
{
	int x=2;

	{
		int *y=new int;
		*y=4;
	}

	cout<<x;
	cout<<*y;
	
return 0;
}

int main()
{
	Stack s;
	s.push(2);
	s.push(4);
		
	s.push(8);

	...etc

	// pop numbers
	
	return 0;

}