卡片游戏

最新推荐文章于 2022-03-08 17:08:12 发布

一只会冒泡的猫

最新推荐文章于 2022-03-08 17:08:12 发布

阅读量346

点赞数

分类专栏：队列

本文链接：https://blog.csdn.net/kangyan__/article/details/75153236

版权

队列专栏收录该内容

8 篇文章 0 订阅

订阅专栏

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 Input

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

题意：有一副编号从1-----n的卡片，把第一张输出，第二张放在最后面去，以此类推，直到最后一张单独输出，当n==1时，要输出这个，
Discarded cards:
Remaining card: 1

还要注意每行最后不能有多余的空格

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int main()
{
    int n;
    char ch;
    queue<int> Q;
    while(~scanf("%d",&n),n)
    {
        int a,ok=0;
        while(!Q.empty())
            Q.pop();
        for(int i=1; i<=n; i++)
            Q.push(i);
        printf("Discarded cards:");
        while(Q.size()>=2)
        {
            printf(" %d%c",Q.front(),Q.size()==2?ch='\n':ch=',');
            Q.pop();
            a=Q.front();
            Q.pop();
            Q.push(a);
        }
        if(n==1)
            printf("\n");
        printf("Remaining card: %d\n",Q.front());
    }
    return 0;
}