Divide candy (circular queue)

#include<iostream>
using namespace std;

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10

typedef int ElemType;
typedef int Status;

int all = 0;

// First element ：Q->front->next->data
// The last element ：Q->rear->data

typedef struct Node {      // Store data field and pointer field （ Auxiliary ）
	ElemType data;
	struct Node* next;
}QNode, * QueuePtr;

typedef struct {           // Pointer to the beginning and end of the queue （ Lord ）
	QueuePtr front;
	QueuePtr rear;
}LinkQ, * LinkQueue;

LinkQueue InitQueue() {       // Construct an empty queue 
	LinkQueue Q;
	Q = (LinkQueue)malloc(sizeof(LinkQ));
	Q->front = Q->rear = (QueuePtr)malloc(sizeof(QNode));
	Q->front->next = NULL;
	return Q;
}

LinkQueue link_Queue(LinkQueue Q) {	// Connect into a circular queue 
	Q->rear->next = Q->front->next;
	return Q;
}

void PrintQueue(LinkQueue Q) {      // Output queue 
	while (Q->front->next) {
		printf("%d ", Q->front->next->data);
		Q->front = Q->front->next;
	}
}

void PrintQueueL(LinkQueue Q, int length) {	// Output data of the specified length in the queue 
	for (int i = 1; i <= length; i++) {
		cout << Q->front->next->data << " ";
		Q->front = Q->front->next;
	}
}

void DestroyQueue(LinkQueue Q) {    // Destroy queue 
	while (Q->front) {
		Q->rear = Q->front->next;
		free(Q->front);
		Q->front = Q->rear;
	}
}

void EnQueue(LinkQueue Q, int e) {  // Insert elements e End of team element 
	QueuePtr p = (QueuePtr)malloc(sizeof(QNode));
	p->data = e;
	p->next = NULL;
	Q->rear->next = p;
	Q->rear = p;
}

Status DeQueue(LinkQueue Q) {      // Return to team leader element 
	if (Q->front == Q->rear) return 0;
	int e = Q->front->next->data;
	return e;
}

LinkQueue LinkHalf(LinkQueue Q,int length) {	// Pass half to the next 
	int a[10000] = {};
	for (int i = 1; i <= length; i++) {
		a[i] = Q->front->next->data/2;
		Q->front = Q->front->next;
	}
	for (int i = 1; i <= length; i++) {
		a[i+length] = Q->front->next->data/2;
		Q->front = Q->front->next;
	}
	for (int i = 1; i <= length; i++) {
		Q->front->next->next->data += a[i] - a[i + 1];
		Q->front = Q->front->next;
	}
	return Q;
}

int panduanQueue(LinkQueue Q, int length) {	// Determine whether all elements are equal 
	for (int i = 1; i < length; i++) {
		if (Q->front->next->data != Q->front->next->next->data) {
			return 0;
		}
		Q->front = Q->front->next;
	}
	return 1;
}



LinkQueue jishujiayi(LinkQueue Q, int length) {
	for (int i = 1; i <= length; i++) {
		if (Q->front->next->data % 2 == 1) {
			Q->front->next->data++;
			all++;
		}
		Q->front = Q->front->next;
	}
	return Q;
}

int main() {
	LinkQueue Q;
	Q = InitQueue();
	int N,temp;
	cin >> N;
	int i, j;
	for (i = 1; i <= N; i++) {
		cin >> temp;
		EnQueue(Q, temp);
	}
	Q = link_Queue(Q);
	while (!panduanQueue(Q, N)) {
		Q=LinkHalf(Q, N);
		//cout << " result 1 yes " << endl;
		//PrintQueueL(Q, N);
		Q = jishujiayi(Q, N);
		//cout << " The result is " << endl;
		//PrintQueueL(Q, N);
	}
	cout <<  all << endl;
	return 0;
}

test result ：