fork download
  1. #include <stdio.h>
  2. #define SIZE 5
  3.  
  4. int queue[SIZE];
  5. int head,tail;
  6.  
  7. void enqueue(int value);
  8. int dequeue(void);
  9.  
  10. int main(void) {
  11. head=tail=0;
  12. int resp,data,i;
  13.  
  14. while(1){
  15. printf("1:enqueue 2:dequeue 0:end\n");
  16. scanf("%d",&resp);
  17.  
  18. if(!resp) break;
  19.  
  20. switch(resp){
  21. case 1:
  22. printf("enqueue:");
  23. scanf("%d",&data);
  24. enqueue(data);
  25. break;
  26. case 2:
  27. dequeue();
  28. break;
  29. }
  30. printf("haed=%d tail=%d\n",head,tail);
  31. }
  32. printf("\n");
  33. while(i != tail){
  34. printf("queue[%d]=%d\n",i,queue[i]);
  35. i++;
  36. i=i%SIZE;
  37. }
  38.  
  39. return 0;
  40. }
  41.  
  42. void enqueue(int value){
  43. if(head == (tail+1) % SIZE){
  44. printf("キューが満杯で入りません\n");
  45. }else{
  46. queue[tail++] = value;
  47. }
  48. tail = tail % SIZE;
  49. }
  50.  
  51. int dequeue(void){
  52. int value;
  53. if(head == tail){
  54. printf("キューは空で取り出せません\n");
  55. return 0;
  56. }else{
  57. value = queue[head++];
  58. head = head % SIZE;
  59. return value;
  60. }
  61. }
Success #stdin #stdout 0s 5316KB
stdin
1
43
1
54
1
65
1
54
2
0
stdout
1:enqueue 2:dequeue 0:end
enqueue:haed=0 tail=1
1:enqueue 2:dequeue 0:end
enqueue:haed=0 tail=2
1:enqueue 2:dequeue 0:end
enqueue:haed=0 tail=3
1:enqueue 2:dequeue 0:end
enqueue:haed=0 tail=4
1:enqueue 2:dequeue 0:end
haed=1 tail=4
1:enqueue 2:dequeue 0:end

queue[0]=43
queue[1]=54
queue[2]=65
queue[3]=54