题解 | 围圈报数(队列版）

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<queue>
using namespace std;
int main() {
	int m,n,no,cur;
	int p = 1;
	queue<int> ppqueue;
	scanf("%d", &m);

	for (int i = 0; i < m; i++) {
		scanf("%d", &n);
		for (int j = 1; j <= n; j++) {
			ppqueue.push(j);
		}
		int say = 1;
		while (1) {
			cur = ppqueue.front();
			ppqueue.pop();
			if (say == 3) {
				say = 1;
				if (ppqueue.empty()) {
					printf("%d\n", cur);
					break;
				}
				else {
					printf("%d ",cur);
				}
			}
			else {
				say++;
				ppqueue.push(cur);
			}
		}
	}
}