#include <stdio.h>
#define SIZE 100
int queue[SIZE];
int front = -1, rear = -1;
void enqueue(int value) {
if (rear == SIZE - 1)
printf("Queue is full\n");
else {
if (front == -1)
front = 0;
rear++;
queue[rear] = value;
printf("Inserted %d\n", value);
}
}
void dequeue() {
if (front == -1 || front > rear)
printf("Queue is empty\n");
else {
printf("Deleted: %d\n", queue[front]);
front++;
}
}
void display() {
if (front == -1 || front > rear)
printf("Queue is empty\n");
else {
for (int i = front; i <= rear; i++)
printf("%d ", queue[i]);
printf("\n");
}
}
int main() {
enqueue(10);
enqueue(20);
display();
dequeue();
display();
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNkZWZpbmUgU0laRSAxMDAKCmludCBxdWV1ZVtTSVpFXTsKaW50IGZyb250ID0gLTEsIHJlYXIgPSAtMTsKCnZvaWQgZW5xdWV1ZShpbnQgdmFsdWUpIHsKICAgIGlmIChyZWFyID09IFNJWkUgLSAxKQogICAgICAgIHByaW50ZigiUXVldWUgaXMgZnVsbFxuIik7CiAgICBlbHNlIHsKICAgICAgICBpZiAoZnJvbnQgPT0gLTEpCiAgICAgICAgICAgIGZyb250ID0gMDsKICAgICAgICByZWFyKys7CiAgICAgICAgcXVldWVbcmVhcl0gPSB2YWx1ZTsKICAgICAgICBwcmludGYoIkluc2VydGVkICVkXG4iLCB2YWx1ZSk7CiAgICB9Cn0KCnZvaWQgZGVxdWV1ZSgpIHsKICAgIGlmIChmcm9udCA9PSAtMSB8fCBmcm9udCA+IHJlYXIpCiAgICAgICAgcHJpbnRmKCJRdWV1ZSBpcyBlbXB0eVxuIik7CiAgICBlbHNlIHsKICAgICAgICBwcmludGYoIkRlbGV0ZWQ6ICVkXG4iLCBxdWV1ZVtmcm9udF0pOwogICAgICAgIGZyb250Kys7CiAgICB9Cn0KCnZvaWQgZGlzcGxheSgpIHsKICAgIGlmIChmcm9udCA9PSAtMSB8fCBmcm9udCA+IHJlYXIpCiAgICAgICAgcHJpbnRmKCJRdWV1ZSBpcyBlbXB0eVxuIik7CiAgICBlbHNlIHsKICAgICAgICBmb3IgKGludCBpID0gZnJvbnQ7IGkgPD0gcmVhcjsgaSsrKQogICAgICAgICAgICBwcmludGYoIiVkICIsIHF1ZXVlW2ldKTsKICAgICAgICBwcmludGYoIlxuIik7CiAgICB9Cn0KCmludCBtYWluKCkgewogICAgZW5xdWV1ZSgxMCk7CiAgICBlbnF1ZXVlKDIwKTsKICAgIGRpc3BsYXkoKTsKICAgIGRlcXVldWUoKTsKICAgIGRpc3BsYXkoKTsKICAgIHJldHVybiAwOwp9CgogICAg