Untitled

#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>

#define MAX 100

int arr[MAX];
int front;
int rear;
int size;

void dequeInit(int n) {
	front = -1;
	rear = 0;
	size = n;
}

bool isFull() {
	return ((front == 0 && rear == size - 1) || front == rear + 1);
}

bool isEmpty() {
	return (front == -1);
}

void insertFront(int value) {
	if (isFull()) {
		printf("Overflow\n");
	}

	if (front == -1) {
		front = rear = 0;
	}
	else if (front == 0) {
		front = size - 1;
	}
	else {
		front = front - 1;
	}

	arr[front] = value;
}

void insertRear(int value) {
	if (isFull()) {
		printf("Overflow\n");
	}

	if (front == -1) {
		front = rear = 0;
	}
	else if (rear == size - 1) {
		rear = 0;
	}
	else {
		rear = rear + 1;
	}

	arr[rear] = value;
}

int getFront() {
	if (isEmpty()) {
		printf("Underflow\n");
		return -1;
	}
	return arr[front];
}

int getRear() {
	if (isEmpty() || rear < 0) {
		printf("Underflow\n");
		return -1;
	}
	return arr[rear];
}

void deleteFront() {
	if (isEmpty()) {
		printf("Underflow\n");
		return;
	}

	if (front == rear) {
		front = -1;
		rear = -1;
	}
	else if (front == size - 1) {
		front = 0;
	}
	else {
		front = front + 1;
	}
}

void deleteRear() {
	if (isEmpty()) {
		printf("Underflow\n");
		return;
	}

	if (front == rear) {
		front = -1;
		rear = -1;
	}
	else if (rear == 0) {
		rear = size - 1;
	}
	else {
		rear = rear - 1;
	}
}

int main(void) {

	int T, N, M;

	scanf("%d", &T);

	for (int test_case = 1; test_case <= T; ++test_case) {

		scanf("%d%d", &N, &M);

		dequeInit(N);

		printf("#%d ", test_case);

		for (int i = 0; i < M; ++i) {
			
			int cmd, elem;

			scanf("%d", &cmd);

			switch (cmd) {
			case 1:
				scanf("%d", &elem);
				insertFront(elem);
				break;
			case 2:
				scanf("%d", &elem);
				insertRear(elem);
				break;
			case 3:
				printf("%d ", getFront());
				break;
			case 4:
				printf("%d ", getRear());
				break;
			case 5:
				deleteFront();
				break;
			case 6:
				deleteRear();
				break;
			}
		}

		printf("\n");
	}

	return 0;
}