UVA 10935 Throwing cards away I

Description

Given is an ordered deck of n cards numbered 1to n with card 1 at the top and card n at thebottom. The following operation is performed aslong as there are at least two cards in the deck:Throw away the top card and movethe card that is now on the top of thedeck to the bottom of the deck.Your task is to find the sequence of discardedcards and the last, remaining card.

 

Input

Each line of input (except the last) contains anumber n ≤ 50. The last line contains ‘0’ andthis line should not be processed.

 

Output

For each number from the input produce twolines of output. The first line presents the sequenceof discarded cards, the second line reportsthe last remaining card. No line will haveleading or trailing spaces. See the sample for theexpected format.

 

Sample Input

7
19
10
6
0

 

Sample Output

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~n张卡牌入队，然后按照丢掉下一张牌，再将下一张牌放入队列尾部这样的操作顺序进行循环，直到只剩下最后一张牌。需要注意的是初始只有一张卡牌的特殊情况

 

 

#include<iostream>  
#include<cstdio>  
#include<stack>  
#include<string>
#include<vector>
#include<sstream>
#include<math.h>
#include<queue>
using namespace std;

int main() {
	
	int n;
	queue<int> cards;
	while (scanf("%d", &n) != EOF&&n != 0)
	{
		for (int i = 1; i < n+1; i++)
		{
			cards.push(i);
		}
		printf("Discarded cards:");
		if (cards.size() == 1)
		{
			printf("\n");
		}
		while (cards.size()>=2)
		{
			int j;
			j = cards.front();
			cards.pop();
			if (cards.size() == 1)
			{
				printf(" %d\n",j);
			}
			else
			{
				printf(" %d,",j);
			}			
			j = cards.front();
			cards.pop();
			cards.push(j);
		}

		printf("Remaining card: %d\n",cards.front());
		cards.pop();

	}
	return 0;
}