Throwing cards away I(queue)_q - throwing cards away i-优快云博客

本文链接：https://blog.youkuaiyun.com/ACGIRL45/article/details/115335978

本文介绍了一道关于队列操作的问题，要求根据输入的数字n进行特定的队列操作并输出丢弃卡片的序列及最后剩余的卡片。题目中，每次操作移除顶部卡片并将顶部的卡片移至底部，直至队列只剩一张卡片。对于每个输入的n，需要给出丢弃卡片的顺序和最终留下的卡片。示例展示了对于不同n值的输出格式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

真的是忍不住吐槽一下这道坑点题！

就是一道简单的队列题，但是我提交了四次，就是因为空格的位置

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

题意，一个数字n，从1到n依次入队列，出队一个再次入队一个。

#include<iostream>
#include<queue>
using namespace std;

int a[55];
queue<int> q;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n;
	int b;
	int t;
	bool flag;
	while(cin>>n&&n!=0){
		t=0;
		flag=true;
		
		
		
		for(int i=1;i<=n;i++){
			q.push(i);
		}
		if(n==1){
			cout<<"Discarded cards:"<<endl;
		}
		else cout<<"Discarded cards:";
		
		while(q.size()>1){
			if(q.size()-1!=1){
				cout<<' '<<q.front()<<",";
			}
			else{
				cout<<" "<<q.front()<<endl;
			}
			q.pop();
			q.push(q.front());
			q.pop();
			
		}
		cout<<"Remaining card: ";
		cout<<q.front()<<endl;
		q.pop();
	}
	
	
	return 0;
}