uva 10935

stl 队列的水题。

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

int main(){
    int n;
    while(cin >> n && n!=0){
        queue<int> q;
        for(int i = 1;i <=n;i++) q.push(i);
        cout<<"Discarded cards:";
        while(q.size() !=1){
            cout<<" "<<q.front();q.pop();
            q.push(q.front());q.pop();
            if(q.size()!=1) cout<<",";
        }
        cout<<"\nRemaining card: "<<q.front()<<endl;
        q.pop(); 
    }
    return 0;
}