#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <locale.h>
typedef struct STACK
{
	int temp;
	struct STACK *next;
}stack;
void insert(stack **ptr, int elem)
{
	stack *x = (stack *)malloc(sizeof(stack));
	x->temp = elem;
	x->next = *ptr;
	*ptr = x;
}
int del(stack **ptr, int *error)
{
	stack *old_elem = *ptr;
	int old_temp = 0;
	if (*ptr)
	{
		old_temp = old_elem->temp;
		*ptr = (*ptr)->next;
		free(old_elem);
		*error = 0;
	}
	else
		*error = 1;
	return (old_temp);
}
int main()
{
	int error;
	stack *s1 = NULL;
	int value;
	for (int i = 0; i < 5; i++)
	{
		value = rand() % 10;
		insert(&s1, value);
		printf("%d\n", del(&s1, &error));
	}
	_getch();
}