Uva 10935 Throwing cards away I
来源:互联网 发布:电脑用什么优化软件好 编辑:程序博客网 时间:2024/05/21 10:42
Problem B: Throwing cards away I
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
7191060
Output for sample input
Discarded cards: 1, 3, 5, 7, 4, 2Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8Remaining card: 4Discarded cards: 1, 3, 5, 2, 6Remaining card: 4
不得不说,此题过水。。。
唯一需要注意的是输入1时候,后面不能有空格,可以用文件测出来
#include <bits/stdc++.h>using namespace std;int main(){#ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);#endif int n; while(cin >> n, n!=0) { list<int> lst; vector<int> discard; for(int i = 1; i<= n; i++) lst.push_back(i); while(lst.size()>=2) { discard.push_back(lst.front()); lst.pop_front(); int temp = lst.front(); lst.pop_front(); lst.push_back(temp); } cout << "Discarded cards:"; bool flag = false; for(auto i : discard) { if(flag == false) { cout << " " << i ; flag = true; } else cout << ", " << i ; } cout << endl; cout << "Remaining card: " << lst.front() << endl; } return 0;}
0 0
- UVA 10935 - Throwing cards away I
- UVA 10935 - Throwing cards away I
- UVa 10935 - Throwing cards away I STL
- uva 10935 - Throwing cards away I
- UVa 10935 Throwing cards away I
- UVA - 10935 Throwing cards away I
- Uva 10935 Throwing cards away I
- UVa 10935 - Throwing cards away I
- UVa 10935 - Throwing cards away I
- UVa 10935 - Throwing cards away I
- UVA - 10935 Throwing cards away I (数组)
- UVa 10935 - Throwing cards away I
- Uva - 10935 - Throwing cards away I
- UVa 10935 - Throwing cards away I
- UVa 10935 - Throwing cards away I
- Uva 10935 Throwing cards away I
- UVa 10935 Throwing cards away I
- uva 10935Throwing cards away I
- Poj 2063 Investment
- Eculid算法递归地求解GCD(Greatest Common Divisor,最大公约数)
- 条款:06 若不想让编译器自动生成函数,则明确拒绝
- 第十三周oj平台项目二
- three.js 源码注释(十九)Math/Spline.js
- Uva 10935 Throwing cards away I
- CSU 1339: 最后一滴血(模拟啊 湖南省第九届大学生计算机程序设计竞赛)
- VIM使用技巧1
- Yale开放课程博弈论20
- tomcat通过conf-Catalina-localhost目录发布项目详解
- 第十三周 项目四--数组的排序(1)对数字排序
- [算法导论] BF算法与KMP算法
- Android数据存储
- js四舍五入小数