UVaOJ 10935 Throwing cards away I
2016-07-21 19:35
267 查看
Throwing 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 thedeckto the bottom of the deck.Your task is to find the sequence of discardedcards and the last, remaining card.
Input
Each line of input (except the last) contains anumber n ≤ 50. The last line contains ‘0’ andthis line should not be processed.
Output
For 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
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
题目大意:给出一堆牌,当牌数大于等于2张时进行如下操作
(1)拿走牌顶的第一张牌
(2)将新的第一张牌放到牌底
输出每次拿出的牌以及最后剩下的那张牌。
解题思路:队列模拟,注意输出格式!
代码如下:
#include <cstdio> #include <queue> #include <algorithm> using namespace std; int main() { queue<int> que; int n; while(scanf("%d",&n) != EOF && n){ for(int i = 1;i <= n;i++){ que.push(i); } printf("Discarded cards:"); while(que.size() >= 2){ if(que.size() > 2) printf(" %d,",que.front()); else printf(" %d",que.front()); que.pop(); int temp = que.front(); que.pop(); que.push(temp); } printf("\n"); printf("Remaining card:"); printf(" %d\n",que.front()); que.pop(); } return 0; }
相关文章推荐
- uvaoj 10055 java版
- 【UvaOJ 重要!】【基础题目】【Maths - Number Theory】 10392 - Factoring Large Numbers
- 【UvaOJ】【基础题目】【Maths - Number Theory】 408和350 伪随机数
- 【UvaOJ】【基础题目】【Maths - Number Theory】 10110 - Light, more light
- 【UvaOJ】【基础题目】【Maths - Misc】 10014 - Simple calculations
- 【UvaOJ】【基础题目】【Maths - Misc】 10970 - Big Chocolate
- 【UvaOJ】【基础题目】【Maths - Misc】 10916 - Factstone Benchmark
- 【UvaOJ】【基础题目】【Maths - Misc】 107 - The Cat in the Hat
- 【UvaOJ】【基础题目】【Maths - Misc】 846 - Steps
- 【UvaOJ】【基础题目】【Maths - Misc】 10790 - How Many Points of Intersection?
- UVAOJ--10718 Bit Mask
- uvaoj 1073 - Glenbow Museum
- uvaoj 11796 - Dog Distance
- uvaoj 10253 - Series-Parallel Networks
- UVaOJ 11038 How Many O's?
- UVaOJ 11375 Matches
- 开始刷UVAOJ上的题了(不断更新。。。)
- UVAOJ 10591 happy number
- UVAOJ 10098 Generating Fast
- UVAOJ 10085 The most distant state