UVa 10935 Throwing cards away I(习题5-3)
来源:互联网 发布:如何成为一个网络作家 编辑:程序博客网 时间:2024/05/29 08:42
题目可以用队列(queue)来做,大概思路就是循环直到剩一张牌,奇数次扔牌,偶数次把第一张换到最后,使用队列的push以及pop就可以完成操作,不过需要注意的是格式和只有一张牌的时候不扔牌,这就是为什么代码提交了很多次都是WA的原因,后来加了一个判断,成功AC
代码:
#include<cstdio>#include<iostream>#include<sstream>#include<queue>using namespace std;int main(){int n;while(cin>>n&&n!=0){queue<int> card;int s[n+2],j=0; for(int i=1;i<=n;i++) card.push(i);if (n==1) //一张牌不能扔 { cout<<"Discarded cards:"<<endl;cout<<"Remaining card: "<<(card.front())<<endl;continue;}else {for(int i=1;card.size()!=1;i++){if(i%2!=0){int k;k=card.front();card.pop();s[j]=k;j++; }else{int k;k= card.front();card.pop();card.push(k);}}}cout<<"Discarded cards:";for (int i=0;i<n-2;i++)cout<<" "<<s[i]<<",";cout<<" "<<s[n-2]<<endl;cout<<"Remaining card: "<<(card.front())<<endl;}return 0;}
0 0
- UVa 10935 Throwing cards away I(习题5-3)
- uva 10935 Throwing cards away I 习题5-3 (STL queue练习)
- 习题5-3 UVA 10935 Throwing cards away I 卡片游戏
- 习题5-3 卡片游戏(Throwing cards away I, UVa 10935)
- Uva10935 Throwing cards away I 【queue】【习题5-3】
- 经典第五章 习题 5-3 UVA 10935 Throwing cards away I(队列的简单应用)
- 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
- 331. Verify Preorder Serialization of a Binary Tree
- Android源码分析——Looper,Messagequeue,Message,handler初始化及handler机制简介
- 使用socket编程
- Java和Objective-C用 成员变量名字符串 给成员变量赋值
- 一个程序员给产品经理的话
- UVa 10935 Throwing cards away I(习题5-3)
- Codeforces #364(Div.2)C.They Are Everywhere【思维】
- CodeForces 699D—— Fix a Tree(并查集判断环)
- Android Service 学习总结 1
- iOS开发UI篇—程序启动原理和UIApplication
- HDU 5738 Eureka(map瞎搞)
- B - B
- Android性能调优利器StrictMode
- 模拟常见的字符操作函数