题解 | #【模板】循环队列#

#include <iostream>
#include <queue>
using namespace std;

int main() {
    int n, q;
    string str;
    int num;
    queue<int> que;
    cin >> n >> q ;
    for (int i = 0; i < q; i++) {
        cin >> str;
        if (str == "push") {
            cin >> num;
            if (que.size() < n) {
                que.push(num);
            } else {
                cout << "full" << endl;
            }
        }
        if (str == "front") {
            if (que.empty()) {
                cout << "empty" << endl;
            } else {
                cout << que.front() << endl;
            }
        }
        if (str == "pop"){
            if (que.empty()) {
                cout << "empty" << endl;
            } else {
                cout << que.front() << endl;
                que.pop();
            }
        }
    }
    return 0;
}
// 64 位输出请用 printf("%lld")