Throwing cards away I uva1594

Throwing cards away IGiven is an ordered deck of N cards numbered 1 toN With card 1 at the top and card N At the bottom. 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

Code:

#include <cstdio>using namespace Std;int q[200];int main () {    int head,tail,x;    while (scanf ("%d", &x)!=eof&&x!=0)    {for        (int i=1;i<=x+1;i++)        q[i]=i;        head=1;        tail=x+1;        printf ("Discarded cards:");        while (HEAD<TAIL-1)        {        if (head<tail-2)          printf ("%d,", Q[head]);          else            printf ("%d", Q[head]);             head++;             Q[tail]=q[head];        tail++;          head++;        }        printf ("\ n");       printf ("Remaining card:");        printf ("%d", Q[head]);        printf ("\ n");    }    return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Throwing cards away I uva1594