【Uva - 10935】 Throwing cards away I （既然是I，看来还有Ⅱ、Ⅲ、Ⅳ？）（站队问题队列问题）

2024-05-27 13:10:24

题干：

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.

Each line of input (except the last) contains a number n ≤ 50. The last line contains 0 and this line should not be processed. 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

Output for sample input

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的时候，还不能带空格。

AC代码：

#include<bits/stdc++.h>using namespace std;int main()
{int n;while(~scanf("%d",&n)) {if(n == 0) break;else if(n == 1) {printf("Discarded cards:\n");printf("Remaining card: 1\n");continue;}queue<int > q;int flag = 0;for(int i =1 ; i<=n; i++) q.push(i);printf("Discarded cards: ");while(q.size()>1) {if(flag == 0) {printf("%d",q.front());q.pop();if(q.size() == 1) continue;q.push( q.front() );q.pop();flag = 1;continue;}printf(", %d",q.front());q.pop();if(q.size() == 1) continue;q.push( q.front() );q.pop();}printf("\nRemaining card: %d\n",q.front());q.pop();}return 0 ;
}

【Uva - 10935】 Throwing cards away I （既然是I，看来还有Ⅱ、Ⅲ、Ⅳ？）（站队问题队列问题）相关推荐

UVa 10935 - Throwing cards away I
模拟队列操作. 注意当n == 1时第一行输出末尾没有空格.PE一次~~~ 代码 : import java.util.*;public class Main10935 {public stati ...
10行代码AC——UVa 10940(Throwing cards away II 数学规律+约瑟夫环)
励志用尽量少的代码做高效表达题目(提交)链接-->UVa-10940 问题分析本题的时间要求是3s,但极限数据量为50W*50W,一般来说,3s的时间只能支持不到三千万次的运算,也就是说,即 ...
17行代码AC——习题5-3 卡片游戏(Throwing cards away I, UVa 10935，约瑟夫环)_解题报告
励志用少的代码做高效的表达题目(提交)链接→UVa-10935 本题为水题,因此侧重点由解题转向优化. 解题思路: 解法一思路:用vector动态数组存储,可以方便的实现插入.删除等操作. 解法二思 ...
UVA 10935 卡片游戏
这个题虽然很简单,但是也蛮坑的,需要注意,当输入的n为1时是不会有被丢弃的卡片的.而且,这个题有一个小bug,就是当输入的n = 2时,被丢弃的卡片只有一张,所以正确的输出格式应该为应该把cards改 ...
UVa 1586 Molar mass 分子量题解
英文 Description An organic compound is any member of a large class of chemical compounds whose molecu ...
暑期集训1:C++STL 例2:UVA-10935
2018学校暑期集训第一天--C++与STL 例二 -- UVA - 10935 Throwing cards away I Given is an ordered deck of n cards ...
π-Algorithmist分类题目（1）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(1) Sorting UVAL ...
紫书《算法竞赛入门经典》
紫书<算法竞赛入门经典>题目一览第3章数组和字符串(例题) UVA 272 TEX Quotes UVA 10082 WERTYU UVA 401 Palindromes UVA 34 ...
算法竞赛入门经典（第2版）—第五章（C++与STL入门）
文章目录零碎知识点整理题目 10474 - Where is the Marble? 101 - The Blocks Problem 10815 - Andy's First Dictionar ...

最新文章

热门文章