数据结构舞伴问题——C语言

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define OK 1
#define ERROR 0
typedef struct
{
	char name[20];
	char sex;
}Person;
typedef struct
{
	Person m[20];//存储名字和性别
	Person *base;//存储空间的基地址
	int front;//头指针
	int rear; //尾指针
}SqQueue;
SqQueue *mdancers(SqQueue *mq)//队列初始化
{
	mq = (SqQueue *)malloc(sizeof(SqQueue));//为新建的队列申请一段存储空间
	if(!mq -> base) exit(0);//存储分配失败
	mq -> front = -1;//置空队
	mq -> rear = -1;
	return mq;
}
Inqueue(SqQueue *mq, Person p)//入队
{
	if((mq -> rear + 1) % 20 == mq -> front)
	{
		printf("队满！");
	}
	else
	{
	    mq -> rear++;
	    mq -> m[mq->rear] = p;
	}
}
int Equeue(SqQueue *mq)//判断队列是否为空 
{
    if (mq -> front == mq -> rear)   return OK;
    else return ERROR;
}
dancers(Person p[20], int num, SqQueue *mq, SqQueue *fq)//匹配 
{
	int i;
	Person q;
	printf("请输入参与者的姓名，性别\n");
	getchar();