10935 - Throwing cards away I

Given is anordered deck of n cards numbered 1 to n withcard 1 at the top and card n at the bottom. The followingoperation is performed as long as there are at least two cards in the deck:

Throw away the topcard and move the card that is now on the top of the deck to the bottom of thedeck.

Your task is tofind the sequence of discarded cards and the last, remaining card.

Each line of input(except the last) contains a number n ≤ 50. The last linecontains 0 and this line should not be processed. For each number from theinput produce two lines of output. The first line presents the sequence ofdiscarded cards, the second line reports the last remaining card. No line willhave leading or trailing spaces. See the sample for the expected format.

Sample input

7

19

10

6

0

Output forsample input

Discardedcards: 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

代码:

#include

#include

using namespacestd;

int main()

{

    int num;

    while(cin>>num&&num!=0)

    {

        queue q;

        for(int i=1;i<=num;i++)

        {

            q.push(i);

        }

        cout<<"Discarded cards:";

        if(q.size()!=1)

        {

            cout<

            q.pop();

            q.push(q.front());

            q.pop();

        }

        while(q.size()!=1)

        {

            cout<<","<

            q.pop();

            q.push(q.front());

            q.pop();

        }

        cout<

        cout<<"Remaining card:"<

    }

}

队列基本操作,注意输出格式的要求即可