UVA 10935 Throwing cards away I
2017-11-08 16:35
489 查看
题目大意:有n张牌 从第一张牌开始 从上向下依次编号为1~n。当至少还剩下俩张牌时进行以下操作:把第一张牌扔掉,然后把新的第一张牌放到整叠牌的最后。输入每行包含一个n,输出每次扔掉的牌以及最后剩下的牌
解题思路:暴力模拟
解题思路:暴力模拟
#include <cstdio> #include <iostream> #include <algorithm> #include <cstring> #include <queue> using namespace std; int n; queue<int> que; int main() { while(cin >> n) { if(n == 0) break; while(!que.empty()) { que.pop(); } for(int i = 1; i <= n; i++) { que.push(i); } cout << "Discarded cards:"; int p = 0; while(!que.empty()) { int a = que.front(); que.pop(); if(que.empty()) { cout << endl << "Remaining card: " << a << endl; } else { if(p == 1) { cout << ","; } cout << " " << a; int b = que.front(); que.pop(); que.push(b); } p = 1; } } return 0; }
相关文章推荐
- uva10935 - Throwing cards away I
- UVA10935 Throwing cards away I【模拟+queue+循环队列】
- UVa 10935 - Throwing cards away I
- UVA 10935 - Throwing cards away I
- UVA 10935 Throwing Cards Away I 卡片游戏
- UVA - 10935 Throwing cards away I
- UVa10935-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
- Throwing cards away I UVA - 10935
- 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 <queue>