fork download
copy 
  1. #include<stdio.h> 
  2.  
  3. #define SIZE 5 
  4. int queue[SIZE]; 
  5. int head, tail; 
  6.  
  7. void enqueue(int value); 
  8. int dequeue(void); 
  9.  
  10. int main(void) 
  11. { 
  12.     head = tail = 0;    //初期化 
  13.     int data, i; 
  14.  
  15.     enqueue(1); 
  16.     enqueue(2); 
  17.     dequeue(); 
  18.     enqueue(3); 
  19.     dequeue(); 
  20.     enqueue(4); 
  21.     enqueue(5); 
  22.     dequeue(); 
  23.     for(i=0; i<SIZE; i++){ 
  24.       printf("queue[%d]=%d¥n", i, queue[i] ); 
  25.     } 
  26.  
  27.     return 0; 
  28. } 
  29.  
  30. void enqueue(int value) 
  31. { 
  32.     if( head == (tail+1)%SIZE ){ 
  33.         printf("キューは満杯で入りませんでした¥n"); 
  34.     }else{ 
  35.         queue[tail] = value; 
  36.         tail = tail + 1; 
  37.     } 
  38.     tail = tail % SIZE; 
  39. } 
  40.  
  41. int dequeue(void) 
  42. { 
  43.     int value; 
  44.     if( head == tail ){ 
  45.         printf("キューは空で取り出せませんでした¥n"); 
  46.         return 0; 
  47.     }else{ 
  48.         value = queue[head]; 
  49.         queue[head] = 0;        //抽出後に0を代入 
  50.         head = head + 1; 
  51.     } 
  52.     head = head % SIZE; 
  53.     return value; 
  54. } 
  55.  
Success #stdin #stdout 0s 5284KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
queue[0]=0¥nqueue[1]=0¥nqueue[2]=0¥nqueue[3]=4¥nqueue[4]=5¥n
https://ideone.com/AWVgr9
language:
C (gcc 8.3)
created:
8 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!