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. int main(void)
  10. {
  11. 	head=tail=0;
  12. 	int i;
  13. 	enqueue(1);
  14. 	enqueue(2);
  15. 	dequeue();
  16. 	enqueue(3);
  17. 	dequeue();
  18. 	enqueue(4);
  19. 	enqueue(5);
  20. 	dequeue();
  21. 	enqueue(6);
  22.  
  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.  
  34. 	printf("キューは満杯で入りませんでした。");
  35. 	}else{
  36. 	queue[tail]=value;
  37. 	tail=tail+1;
  38. }
  39. 	tail=tail%SIZE;
  40. }
  41. 	int dequeue(void){
  42. 	int value;
  43. 	if(head==tail){
  44. 	printf("キューは空で取り出せませんでした。");
  45. }else{
  46. 	value=queue[head];
  47. 	queue[head]=0;
  48. 	head=head+1;
  49. }
  50. 	head=head%SIZE;
  51. 	return value;
  52. }	
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
Success #stdin #stdout 0.01s 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/6kArLs
language:
C (gcc 8.3)
created:
3 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!