fork download 
  1. #include <stdio.h>
  2.  
  3. #define SIZE 10
  4. double stack[SIZE];
  5. int sp;
  6.  
  7. void push(double value);
  8. double pop(void);
  9. int isFull(void);
  10. int isEmpty(void);
  11. void answer(void);
  12. void reset(void);
  13.  
  14. int main(void)
  15. {
  16.     int cmd;
  17.     double a, b, num;
  18. 	int isEnd=0;
  19.  
  20.     reset();
  21.     while (1)
  22.     {
  23.         scanf("%d", &cmd);
  24.  
  25.         switch (cmd)
  26.         {
  27.         case 1:
  28.             if (sp >= 2) 
  29. 			{
  30.                 b = pop();
  31.                 a = pop();
  32.                 push(a + b);
  33.             } 
  34. 			else 
  35. 			{
  36.                 printf("スタックが足りません\n");
  37.             }
  38.             break;
  39.         case 2:
  40.             if (sp >= 2) 
  41. 			{
  42.                 b = pop();
  43.                 a = pop();
  44.                 push(a - b);
  45.             } 
  46. 			else 
  47. 			{
  48.                 printf("スタックが足りません\n");
  49.             }
  50.             break;
  51.         case 3:
  52.             if (sp >= 2) 
  53. 			{
  54.                 b = pop();
  55.                 a = pop();
  56.                 push(a * b);
  57.             } 
  58. 			else 
  59. 			{
  60.                 printf("スタックが足りません\n");
  61.             }
  62.             break;
  63.         case 4:
  64.             if (sp >= 2) 
  65. 			{
  66.                 b = pop();
  67.                 a = pop();
  68.                 if (b != 0)
  69.                     push(a / b);
  70.                 else
  71.                     printf("0で割れません\n");
  72.             } 
  73. 			else 
  74. 			{
  75.                 printf("スタックが足りません\n");
  76.             }
  77.             break;
  78.         case 5:
  79.             scanf("%lf", &num);
  80. 			printf("data:%lf\n",num);
  81.             push(num);
  82.             break;
  83.         case 9:
  84. 			isEnd = 1;
  85.         }
  86. 	if (isEnd == 1)
  87. 		printf("\n");
  88. 		break;
  89.     }
  90.  
  91. 	answer();
  92.  
  93. 	return 0;
  94.  
  95. }
  96.  
  97. void push(double value)
  98. {
  99.     if (!isFull()) 
  100. 	{
  101.         stack[sp++] = value;
  102.     } 
  103. 	else 
  104. 	{
  105.         printf("スタックが満杯で入りませんでした\n");
  106.     }
  107. }
  108.  
  109. double pop(void)
  110. {
  111.     if (!isEmpty()) 
  112. 	{
  113.         return stack[--sp];
  114.     } 
  115. 	else 
  116. 	{
  117.         printf("スタックが空で取り出せませんでした\n");
  118.         return 0.0;
  119.     }
  120. }
  121.  
  122. int isFull(void)
  123. {
  124.     return sp >= SIZE;
  125. }
  126.  
  127. int isEmpty(void)
  128. {
  129.     return sp <= 0;
  130. }
  131.  
  132. void answer(void)
  133. {
  134.     if (!isEmpty()) 
  135. 	{
  136.         printf("answer: %lf\n", stack[sp - 1]);
  137.     } 
  138. 	else 
  139. 	{
  140.         printf("スタックが空で何も取り出せませんでした\n");
  141.     }
  142. }
  143.  
  144. void reset(void)
  145. {
  146.     sp = 0;
  147. }
  148.  
Success #stdin #stdout 0.01s 5316KB
comments (?)
stdin 
5
1
5
2
1
9
stdout 
data:1.000000
answer: 1.000000
https://ideone.com/L2hxkU
language:
C (gcc 8.3)
created:
4 hours 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!