信息学奥赛一本通 3.2：队列

周末舞会

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

queue<int> q1, q2;
int a, b, n;

int main() {
   
	cin >> a >> b >> n;
	
	for (int i = 1; i <= a; i ++) q1.push(i);
	for (int i = 1; i <= b; i ++) q2.push(i);

	while (n --) {
   
		cout << q1.front() << ' ';
		q1.push(q1.front());
		q1.pop();
		
		cout << q2.front() << endl;
		q2.push(q2.front());
		q2.pop();
	}

	return 0;
}

Blah数集

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

const int N = 1e6+10;
int q[N], tt;

int main() {
   
	int a, n;
	
	while (cin >> a >> n) {
   
		tt = 0;
		q[++tt] = a;
		
		int x = 1, y = 1;
		
		while (tt < n) {
   
			int vx = q[x]*2+1, vy = q[y]*3+1;
			if (vx < vy) x ++ ;
			else y ++ ;
			
			if (min(vx, vy) == q[tt]) continue;
			else q[++tt] = min(vx, vy);
		}
		cout << q[tt] << endl;
	}


	return 0;
}

围圈报数

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

queue<int> q;
int n, m;

int main() {
   
	cin >> n >> m;
	for (int i = 1; i <= n; i ++) q.push(i);

	while (q.size()) {
   
		for (int j = 1; j < m; j ++) {
   
			q.push(q.front());
			q.pop();
		}
		cout << q.front() << ' ';
		q.pop();
	}

	return 0;
}

猴子选大王

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

const int N = 1e6 + 10;
queue<int> q;
int n, m, a[N];

int