【Uva - 10935】 Throwing cards away I （既然是I，看来还有Ⅱ、Ⅲ、Ⅳ？）（站队问题队列问题）,掌中新浪

文件名：【Uva - 10935】 Throwing cards away I （既然是I，看来还有Ⅱ、Ⅲ、Ⅳ？）（站队问题队列问题）,掌中新浪 【Uva - 10935】 Throwing cards away I （既然是I，看来还有Ⅱ、Ⅲ、Ⅳ？）（站队问题队列问题）

题干：

 

Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as 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, 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 7191060 Output for sample input Discarded cards: 1, 3, 5, 7, 4, 2Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8Remaining card: 4Discarded cards: 1, 3, 5, 2, 6Remaining card: 4

解题报告：

    没事水一发还是很好的。。。但是这个输出格式有点坑啊。。1的时候，还不能带空格。

AC代码：

#include<bits/stdc++.h>using namespace std;int main(){int n;while(~scanf("%d",&n)) {if(n == 0) break;else if(n == 1) {printf("Discarded cards:\n");printf("Remaining card: 1\n");continue;}queue<int > q;int flag = 0;for(int i =1 ; i<=n; i++) q.push(i);printf("Discarded cards: ");while(q.size()>1) {if(flag == 0) {printf("%d",q.front());q.pop();if(q.size() == 1) continue;q.push( q.front() );q.pop();flag = 1;continue;}printf(", %d",q.front());q.pop();if(q.size() == 1) continue;q.push( q.front() );q.pop();}printf("\nRemaining card: %d\n",q.front());q.pop();}return 0 ;}