#include 
    
     using namespace std;#define MaxSize 50typedef struct{	int data[MaxSize];	int front,rear;	}SqQueue;void InitQueue(SqQueue &q){	q.rear = q.front = 0;	} bool IsEmpty(SqQueue q){	if(q.rear== q.front) return true;	else return false;	}bool IsFull(SqQueue q){	if((q.rear+1)% MaxSize == q.front) return true;	else return false;	}bool EnQueue(SqQueue &q,int x){	if(IsFull(q)) return false;		q.data[q.rear]=x;	q.rear= (q.rear+1) % MaxSize;	return true;}bool DeQueue(SqQueue &q,int& x){	if(IsEmpty(q)) return false;	x=q.data[q.front];	q.front= (q.front+1)%MaxSize;	return true;}int main(){	SqQueue q;	InitQueue(q);	int i,x;	for(i=0;i<60;i++){		EnQueue(q,i);			}	while(!IsEmpty(q)){		DeQueue(q,x);		cout<
     
      <<"  ";			}	cout<