fork download
copy 
  1. #include<stdio.h>
  2.  
  3. #define SIZE 5
  4. int stack[SIZE];
  5. int sp;
  6.  
  7. void push(int value);
  8. int pop(void);
  9. void display(void);
  10.  
  11. int main(void)
  12. {
  13.     sp = 0;
  14.     int resp, data;
  15.  
  16.     while(1){
  17.         printf("1：push　2:pop　0:end : ");
  18.         scanf("%d", &resp);
  19.  
  20.         if(!resp)  break;
  21.  
  22.         switch(resp){
  23.             case 1: printf("push : "); scanf("%d", &data);
  24.                     push( data );
  25.                     break;
  26.             case 2: printf( "pop : %d ", pop() );
  27.                     break;
  28.         }
  29.         printf("sp=%d\n", sp);
  30.     }
  31.     printf("\n");
  32.     for(int i=0; i<sp; i++){
  33.         printf("stack[%d]=%d \n", i, stack[i]);
  34.     }
  35.  
  36.     return 0;
  37. }
  38.  
  39. void push(int value)
  40. {
  41.     if(sp >= SIZE){
  42.         printf("スタックが満杯で入りませんでした\n");
  43.     }else{
  44.         stack[sp++] = value;
  45.     }
  46. }
  47.  
  48. int pop(void)
  49. {
  50.     if(sp <= 0){
  51.         printf("スタックが空で取り出せませんでした\n");
  52.         return 0;
  53.     }else{
  54.         return stack[--sp];
  55.     }
  56. }
  57.  
  58. void display(void){
  59. 	for(int i=0;i<sp;i++){
  60. 		printf("stack[%d]=%d\n",i,stack[i]);
  61. 	}
  62. }
  63.  
Success #stdin #stdout 0.01s 5360KB
comments (?)
stdin
copy 
1  10  1  20  1  30  2  0
stdout
copy 
1：push　2:pop　0:end : push : sp=1
1：push　2:pop　0:end : push : sp=2
1：push　2:pop　0:end : push : sp=3
1：push　2:pop　0:end : pop : 30 sp=2
1：push　2:pop　0:end : 
stack[0]=10 
stack[1]=20
https://ideone.com/hWmmEL
Ex.1-1
language:
C (gcc 8.3)
created:
326 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!