Problem B: Throwing cards away I
Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck.
Your task is to find the sequence of discarded cards and the last, remaining card.
Each line of input (except the last) contains a number n ≤ 50. The last line contains 0 and this line should not be processed. For each number from the input produce two lines of output. The first line presents the sequence of discarded cards, the second line reports the last remaining card. No line will have leading or trailing spaces. See the sample for the expected format.
Sample input
7 19 10 6 0
Output for sample input
Discarded cards: 1, 3, 5, 7, 4, 2 Remaining card: 6 Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14 Remaining card: 6 Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8 Remaining card: 4 Discarded cards: 1, 3, 5, 2, 6 Remaining card: 4
Folklore, adapted by Piotr Rudnicki
#include <iostream>
#include <queue>
using namespace std;
queue<int> q;
int main()
{
int n;
while(cin >> n && n!=0)
{
for(int i=0; i < n; i++)
q.push(i+1);
cout << "Discarded cards:";
while(!q.empty())
{
if (q.size()==1) break;
if(q.size()==2)
cout <<" " << q.front();
else
cout <<" " << q.front() << ",";
q.pop();
q.push(q.front());
q.pop();
}
cout << endl;
cout << "Remaining card: "<< q.front() << endl;
q.pop();
}
return 0;
}