fork(1) 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.     enqueue(6);
  24.  
  25.     for(i=0; i<SIZE; i++){
  26.       printf("queue[%d]=%d\n", i, queue[i] );
  27.     }
  28.     return 0;
  29. }
  30.  
  31. void enqueue(int value){
  32. 	 if(head == (tail+1)%SIZE){
  33. 		printf("キューは満杯で入り出せませんでした\n");
  34. 	}else{
  35. 		queue[tail++]=value;
  36. 	}
  37.     tail = tail % SIZE;
  38. }
  39.  
  40. int dequeue(void){
  41.     int value;
  42. 	if(head == tail){
  43. 		printf("キューは空で取り出せませんでした\n");
  44. 	}else{
  45. 		value = queue[head];
  46. 		 queue[head] = 0;
  47. 		head++;
  48. 	}
  49.     head = head % SIZE;
  50.     return value;
  51. }
  52.  
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5
https://ideone.com/o7PuX6
language:
C (gcc 8.3)
created:
11 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!