#include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
constint MAXN = 10000007; int q[MAXN], head, tail;
int32_tmain(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) push(i); while (head != tail) { for (int i = 1; i < m; i++) { push(front()); pop(); } cout << front() << ' '; pop(); } return0; }
我们补充一个访问队尾元素的代码
1 2 3 4 5 6 7
intback(){ if (head == tail) { cout << "Queue is empty(队列为空)\n"; return-1; } return q[tail - 1]; }
#include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
int32_tmain(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; queue<int> q; for (int i = 1; i <= n; i++) q.push(i); while (!q.empty()) { for (int i = 1; i < m; i++) { q.push(q.front()); q.pop(); } cout << q.front() << ' '; q.pop(); } return0; }