Uva 10935 Throwing cards away I

Problem B: Throwing cards away I

Givenis an ordered deck of n cards numbered 1 to n withcard 1 at the top and card n at the bottom. The following operation is performed as longas there are at least two cards in the deck: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, thesecond 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

不得不说，此题过水。。。

唯一需要注意的是输入1时候，后面不能有空格，可以用文件测出来

#include <bits/stdc++.h>using namespace std;int main(){#ifndef ONLINE_JUDGEfreopen("in.txt","r",stdin);freopen("out.txt","w",stdout);#endifint n;while(cin >> n, n!=0){list<int> lst;vector<int> discard;for(int i = 1; i<= n; i++)lst.push_back(i);while(lst.size()>=2){discard.push_back(lst.front());lst.pop_front();int temp = lst.front();lst.pop_front();lst.push_back(temp);}cout << "Discarded cards:";bool flag = false;for(auto i : discard){if(flag == false){cout << " " << i ;flag = true;}elsecout << ", " << i ;}cout << endl;cout << "Remaining card: " << lst.front() << endl;}return 0;}

[/code]