卡牌游戏

卡牌游戏：p89

#include<stdio.h>
const int MAXN = 50;
int queue[MAXN];
int main()
{
	int n,front,rear;
	scanf("%d",&n);
	for(int i = 0; i < n; i ++) queue[i] = i+1;
	front = 0;
	rear = n;
	while(front<rear)
	{
		printf("%d ",queue[front++]);
		queue[rear++] = queue[front++];
	}
	return 0;
}

#include<cstdio>
#include<queue>
using namespace std;
queue<int> q;
int main()
{
	int n;
	scanf("%d",&n);
	for(int i = 0; i < n; i ++) q.push(i+1);
	while(!q.empty())
	{
		printf("%d ",q.front());
		q.pop();
		q.push(q.front());
		q.pop();
	}
	return  0;
}