Hàng đợi Queue: FIFO, hàng đợi vòng và code C++, Python

#include <iostream>
#include <queue>
#include <string>
#include <vector>

using namespace std;

vector<string> sinh_nhi_phan(int n) {
    vector<string> ket_qua;
    if (n == 0) return ket_qua;
    ket_qua.reserve(n);

    queue<string> q;
    q.push("1");

    for (int buoc = 0; buoc != n; ++buoc) {
        string hien_tai = q.front();
        q.pop();
        ket_qua.push_back(hien_tai);

        q.push(hien_tai + "0");
        q.push(hien_tai + "1");
    }
    return ket_qua;
}

int main() {
    vector<string> ds = sinh_nhi_phan(7);
    bool dau = true;
    for (const string& s : ds) {
        if (!dau) cout << ' ';
        dau = false;
        cout << s;
    }
    cout << '\n';
    return 0;
}

from collections import deque


def sinh_nhi_phan(n: int) -> list[str]:
    if n <= 0:
        return []
    ket_qua: list[str] = []
    q: deque[str] = deque(["1"])

    for _ in range(n):
        hien_tai = q.popleft()
        ket_qua.append(hien_tai)
        q.append(hien_tai + "0")
        q.append(hien_tai + "1")
    return ket_qua


def main() -> None:
    ds = sinh_nhi_phan(7)
    print(" ".join(ds))


if __name__ == "__main__":
    main()

#include <iostream>
#include <queue>
#include <stdexcept>
#include <vector>

using namespace std;

class HangDoiVong {
private:
    vector<int> a;
    int dau_hang;
    int cuoi_hang;
    int so_luong;
    int suc_chua;

public:
    explicit HangDoiVong(int k)
        : a(k, 0), dau_hang(0), cuoi_hang(0), so_luong(0), suc_chua(k) {}

    bool day_vao(int x) {
        if (so_luong == suc_chua) return false;
        a[cuoi_hang] = x;
        cuoi_hang = (cuoi_hang + 1) % suc_chua;
        ++so_luong;
        return true;
    }

    bool lay_ra() {
        if (so_luong == 0) return false;
        dau_hang = (dau_hang + 1) % suc_chua;
        --so_luong;
        return true;
    }

    int xem_dau() const {
        return so_luong == 0 ? -1 : a[dau_hang];
    }

    int xem_cuoi() const {
        if (so_luong == 0) return -1;
        int vi_tri_cuoi = (cuoi_hang - 1 + suc_chua) % suc_chua;
        return a[vi_tri_cuoi];
    }
};

int vong_tron_josephus(int n, int k) {
    if (n <= 0 || k <= 0) throw invalid_argument("n va k phai duong");
    queue<int> q;
    for (int i = 1; i != n + 1; ++i) {
        q.push(i);
    }
    while (q.size() != 1) {
        for (int dem = 1; dem != k; ++dem) {
            q.push(q.front());
            q.pop();
        }
        q.pop(); // Loại người thứ k
    }
    return q.front();
}

int main() {
    HangDoiVong cq(3);
    cq.day_vao(10);
    cq.day_vao(20);
    cq.day_vao(30);
    cq.lay_ra();
    cq.day_vao(40); // Tái sử dụng ô nhớ chỉ số 0 nhờ phép chia dư % 3

    cout << cq.xem_dau() << ' ' << cq.xem_cuoi() << ' '
         << vong_tron_josephus(7, 3) << '\n';
    return 0;
}

from collections import deque


class HangDoiVong:
    def __init__(self, k: int) -> None:
        self.a = [0] * k
        self.dau_hang = 0
        self.cuoi_hang = 0
        self.so_luong = 0
        self.suc_chua = k

    def day_vao(self, x: int) -> bool:
        if self.so_luong == self.suc_chua:
            return False
        self.a[self.cuoi_hang] = x
        self.cuoi_hang = (self.cuoi_hang + 1) % self.suc_chua
        self.so_luong += 1
        return True

    def lay_ra(self) -> bool:
        if self.so_luong == 0:
            return False
        self.dau_hang = (self.dau_hang + 1) % self.suc_chua
        self.so_luong -= 1
        return True

    def xem_dau(self) -> int:
        return -1 if self.so_luong == 0 else self.a[self.dau_hang]

    def xem_cuoi(self) -> int:
        if self.so_luong == 0:
            return -1
        vi_tri_cuoi = (self.cuoi_hang - 1 + self.suc_chua) % self.suc_chua
        return self.a[vi_tri_cuoi]


def vong_tron_josephus(n: int, k: int) -> int:
    if n <= 0 or k <= 0:
        raise ValueError("n va k phai duong")
    q: deque[int] = deque(range(1, n + 1))
    while len(q) != 1:
        for _ in range(k - 1):
            q.append(q.popleft())
        q.popleft()  # Loại người thứ k
    return q[0]


def main() -> None:
    cq = HangDoiVong(3)
    cq.day_vao(10)
    cq.day_vao(20)
    cq.day_vao(30)
    cq.lay_ra()
    cq.day_vao(40)
    print(f"{cq.xem_dau()} {cq.xem_cuoi()} {vong_tron_josephus(7, 3)}")


if __name__ == "__main__":
    main()