UVA10935纸牌问题

纸牌问题

问题描述

解题思路

注意

代码如下：

#include<iostream>
#include<queue>
using namespace std;
int main()
{
int n;
while(cin>>n&&n)
{
queue<int>q;
for(int i=1;i<=n;i++)
q.push(i);
cout<<"Discarded cards:";
while(!q.empty())
{
if(q.size()>2){
cout<<" "<<q.front()<<",";
q.pop();
q.push(q.front());
q.pop();
}
else if(q.size()==2){
cout<<" "<<q.front();
q.pop();
q.push(q.front());
q.pop();
}
else if(q.size()==1)
break;
}
cout<<endl;
cout<<"Remaining card: "<<q.front()<<endl;
}
}