fork download 
  1. #include<stdio.h>
  2. #define SIZE 5
  3. int queue[SIZE];
  4. int head, tail;
  5.  
  6. void enqueue(int value);
  7. int dequeue(void);
  8.  
  9. int main(void)
  10. {
  11.     head = tail = 0; 
  12.     int data, i;
  13.  
  14. 	enqueue(1);
  15. 	enqueue(2);
  16. 	dequeue();
  17. 	enqueue(3);
  18. 	dequeue();
  19. 	enqueue(4);
  20. 	enqueue(5);
  21. 	dequeue();
  22. 	enqueue(6);
  23.  
  24. 	for(i=0; i<SIZE; i++){
  25. 		printf("queue[%d]=%d\n", i, queue[i] );
  26. 	}
  27.  
  28. 	return 0;
  29. }
  30.  
  31. void enqueue(int value)
  32. {
  33. 	if(head==(tail+1)%SIZE){
  34. 		printf("キューが満杯で追加できません\n");
  35. 	}
  36. 	else{
  37. 		queue[tail++] = value;
  38. 	}
  39. 	tail = tail%SIZE;
  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;
  50. 		head = head % SIZE;
  51.     }
  52.     head = head % SIZE;
  53.     return value;
  54. }
  55.  
  56.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin 
Standard input is empty
stdout 
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5
https://ideone.com/zHXIpW
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!