Topic:
Problem b:throwing cards away I
Given is a ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the Bo Ttom. The following operation is performed as long as there be at least, cards in the deck:
Throw away the top card and move the card that's 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) contains a number n ≤50. The last line contains 0 and this line should is not being processed. For each number from the input produce, lines of output. The first line presents the sequence of discarded cards, the second line reports the last remaining card. No Line would 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, 14Remaining card:6discarded cards:1, 3, 5, 7, 9, 2, 6, ten, 8Remaining card:4discarded cards:1, 3, 5, 2, 6Remainin G Card:4
Analysis: Directly with the queue for simulation can be, but note that when n = 1 o'clock, "discarded cards:" Can not add a space, otherwise, will prompt PE error
The code is as follows:
#include <cstdio>#include<queue>using namespacestd;intMain () {intN; Queue<int>cards; while(SCANF ("%d", &n) = =1&&N) { BOOLFlag =true; //put all the cards in the team for(inti =1; I <= N; i++) Cards.push (i); if(n = =1) printf ("Discarded cards:"); Elseprintf ("Discarded cards:");
//Simulation process while(Cards.size () >1){ if(flag) Flag=false; Elseprintf (", "); //first card out of the teamprintf"%d", Cards.front ()); Cards.pop (); //the new first card to the end of the teamCards.push (Cards.front ()); Cards.pop (); } printf ("\ n"); printf ("Remaining card:%d\n", Cards.front ()); Cards.pop (); } return 0;}
2015-07-04 article
UVa---------10935 (throwing cards away I)