@Nameless One
5781 / 3430 / 255
Регистрация: 08.02.2010
Сообщений: 7,448
|
21.10.2010, 14:39
|
|
Вот "массив стек"  : C | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
| #include <stdio.h>
#include <stdlib.h>
#define SIZE 100
int top = 0;
int stack[SIZE];
void push ( int val )
{
if ( top >= SIZE )
{
puts ( "Can't push: size is max\n" );
exit ( EXIT_FAILURE );
}
printf ( "Pushing #%u element: %d\n", top, val );
stack[top++] = val;
}
int pop()
{
if ( ( --top ) < 0 )
{
puts ( "Can't pop: stack is empty\n" );
exit ( EXIT_FAILURE );
}
printf ( "Poping #%u element: %d\n", top, stack[top] );
return stack[top];
}
int main ( void )
{
size_t i;
for ( i = 0; i < 15; ++i )
push ( i * i + 1 );
while ( top )
pop();
return EXIT_SUCCESS;
} |
|
1
|