UVa 10935 Throwing cards away I 卡片游戏 题解

英文

Description

Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck: Throw away the top card and move the card that is 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.

Input

Each line of input (except the last) contains a number n ≤ 50. The last line contains ‘0’ and this line should not be processed.

Output

For each number from the input produce two lines of output. The first line presents the sequence of discarded cards, the second line reports the last remaining card. No line will have leading or trailing spaces. See the sample for the expected 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

中文

题目大意：

先丢一张牌，再从上往下放一张牌，不断反复。输出依次丢掉的牌和留下的排。

提示：

就是一个队列嘛，一步一步模拟。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#define N 10001
using namespace std;
int q[N],l,r,n,x;
bool bo;
int main()
{
    scanf("%d",&n);
    while(n!=0)
    {
        memset(q,0,sizeof(q));
        for(int i=1;i<=n;i++) q[i]=i;
        l=1; 
        r=n;
        bo=0;
        x=0;
        printf("Discarded cards:");
        while(l<r)
        {
            if(bo==0)
            {
                printf(" %d",q[l]);
                l++;
                x++;
                if(x<n-1) printf(",");
                bo=1;
            } else
            {
                r++;
                q[r]=q[l];
                l++;
                bo=0;
            }
        }
        printf("\n");
        printf("Remaining card: %d\n",q[l]);
        scanf("%d",&n);
    }
    return 0;
}

相关链接：

UVa题解小全：
https://blog.csdn.net/zj_mrz/article/details/81144019

UVa 1225 Digit Counting 题解：
https://blog.csdn.net/zj_mrz/article/details/81207879

UVa 1583 Digit Generator 生成元 题解：
https://blog.csdn.net/zj_mrz/article/details/81143855

UVa 1585 Score 得分 题解：
https://blog.csdn.net/zj_mrz/article/details/81144159

转载于:https://www.cnblogs.com/zj-mrz/p/10122456.html