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