uva-10935-Throwing cards away I

题目传送门： https://vjudge.net/problem/UVA-10935

数组模拟队列

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <math.h>

int main()
{
int n;
while(scanf("%d",&n),n!=0)
{
if(n==1)
{
printf("Discarded cards:\nRemaining card: 1\n");
continue;
}
int a[2000],i,head=1,tail=n;
for(i=1;i<=n;i++)
{
a[i]=i;
}
printf("Discarded cards:");
while(n!=1)
{
printf(" %d%c",a[head],n==2?'\n':',');
a[tail+1]=a[head+1];
head+=2;
tail++;
n--;
}
printf("Remaining card: %d\n",a[tail]);
}
return 0;
}

队列

#include <bits/stdc++.h>

using namespace std;

int main()
{
int n;
while(cin>>n  && n)
{
if(n==1)
{
cout<<"Discarded cards:"<<endl;
cout<<"Remaining card: 1"<<endl;
continue;
}
queue<int> q;

while(!q.empty())
q.pop();
for(int i=1;i<=n;i++)
{
q.push(i);
}
cout<<"Discarded cards:";
while(n!=1)
{
cout<<" "<<q.front();
if(n==2)
{
cout<<endl;
}
else
{
cout<<",";
}
q.pop();
q.push(q.front());
q.pop();
n--;
}
cout<<"Remaining card: "<<q.front()<<endl;
}
return 0;
}