sdsad

#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;#define overlow -2#define error -1#define ok 1#define status int#define maxsize 200#define elemtype inttypedef struct seque{    int *base;    int front;    int real;} seque;status init(seque &Q){    Q.base=(elemtype *)malloc(maxsize*sizeof(elemtype));    if(!Q.base)exit(error);    Q.front=Q.real=0;    return ok;}status inque(seque &Q,elemtype e){    if((Q.real+1)%maxsize==Q.front)exit(error);    Q.base[Q.real]=e;    Q.real=(Q.real+1)%maxsize;    return ok;}status emque(seque Q){    if(Q.front==Q.real)return 1;    return 0;}elemtype qfront(seque Q){    return Q.base[Q.front];}status dequeue(seque &Q){    Q.front=(Q.front+1)%maxsize;    return ok;}int main(){    seque Q;    init(Q);    elemtype e;    while(~scanf("%d",&e))    {        inque(Q,e);    }    elemtype Front;    while(!emque(Q))    {        Front=qfront(Q);        dequeue(Q);        printf("%d",Front);    }    return 0;}