UVA-10935Throwing cards away I

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.InputEach line of input (except the last) contains anumber n ≤ 50. The last line contains ‘0’ andthis line should not be processed.OutputFor 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 Input7191060Sample OutputDiscarded 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, 18, 14Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8Remaining card: 4Discarded cards: 1, 3, 5, 2, 6Remaining card: 4

#include <iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;
int main()
{
    int b[51];
    int i,j;
    int n;
    int l;
    int s1;
    queue<int> a;
    while(scanf("%d",&n),n!=0)
    {
        for(i=1; i<=n; i++)
            a.push(i);
        i=0;
        l=a.size();
        while(l>=2)
        {
            b[i]=a.front();
            a.pop();
            s1=a.front();
            a.push(s1);
            a.pop();
            i++;
            l=a.size();
        }
        printf("Discarded cards:");
        for(j=0; j<i; j++)
        {
            if(j==0)
                printf(" %d",b[j]);
            else
                printf(", %d",b[j]);
        }
        printf("\n");
        printf("Remaining card: %d\n",a.front());
        a.pop();
    }
    return 0;
}