題干：

?

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

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

解題報告：

? ? 沒事水一發(fā)還是很好的。。。但是這個輸出格式有點坑啊。。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 ; }

總結

以上是生活随笔為你收集整理的【Uva - 10935】 Throwing cards away I （既然是I，看来还有Ⅱ、Ⅲ、Ⅳ？）（站队问题队列问题）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。