Personally I know that here is a forum for hacks, but I know that here also has excellent programmers, my college professor told me to do a program that includes data, using the concept of cell, well I did just that it's this error.

'Pp1.exe': Loaded 'C: \ Users \ Yuri \ Documents \ Desktop \ BTodos \ TDA \ pp1 \ De bug \ pp1.exe', Symbols loaded.
'Pp1.exe': Loaded 'C: \ Windows \ SysWOW64 \ ntdll.dll', Symbols loaded (source information stripped).
'Pp1.exe': Loaded 'C: \ Windows \ SysWOW64 \ kernel32.dll', Symbols loaded (source information stripped).
'Pp1.exe': Loaded 'C: \ Windows \ SysWOW64 \ KernelBase.dll', Symbols loaded (source information stripped).
'Pp1.exe': Loaded 'C: \ Windows \ SysWOW64 \ msvcr100d.dll', Symbols loaded (source information stripped).
'Pp1.exe': Loaded 'C: \ Windows \ SysWOW64 \ apphelp.dll', Symbols loaded (source information stripped).
'Pp1.exe': Unloaded 'C: \ Windows \ SysWOW64 \ apphelp.dll'
The program '[9784] pp1.exe: Native' has exited with code 1 (0x1).

Does anyone know how to fix this Budega searched on google but only has threads and English and all they talked and I tried to no avail.

Here's the source code below:


/ * Programa_pilha_02.c * /

# Include
# Include
100 # define TAMANHO_PILHA

/ * Structure that will contain the stack of information * /
struct stack
{
int top;
int items [TAMANHO_PILHA];
};

int empty (struct stack * p)
{
if (p-> top == -1)
{
return 1;
}
return 0;
}

int pop (struct stack * p)
{
if (empty (p))
{
printf ("\ nPilha empty");
exit (1);
}
/ * Returns the item from the current stack and decreases the position of the stack * /
return (p-> items [p-> top -]);
}

void push (struct stack * p, int e)
{
if (p-> top == (TAMANHO_PILHA - 1))
{
printf ("\ nEstouro stack");
exit (1);
}
/ * Check if there would be no after bursting in battery capacity,
h created a new position in the stack and the element h stored * /
p-> items [+ + (p-> top)] = e;
return;
}

int size (struct stack * p)
{
/ * Always remembering that in C, the index of a
vector starts at position 0 * /
return p-> top +1;
}

stackpop int (struct stack * p)
{
return p-> items [p-> top];
}

int main (void)
{
struct stack x;
x.topo = -1;

push (& x, 1);
push (& x, 2);
push (& x, 3);

printf ("\ nSize of the stack% d", size (& x));
printf ("\ nElemento the top of the queue% d", stackpop (& x));

printf ("\ n% d", pop (& x));
printf ("\ n% d", pop (& x));
printf ("\ n% d", pop (& x));
printf ("\ n% d", pop (& x));
system ("PAUSE");
return 0;
}



Thank you for your attention