ACboy needs your help again!
来源:互联网 发布:惠普扫描仪安装软件 编辑:程序博客网 时间:2024/05/21 18:36
队列和栈的模拟(不过我用c++ stl中的queue stack过了~)
Problem Description
ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
Input
The input contains multiple test cases.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
Output
For each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.
Sample Input
44 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT5 FIFOIN 1IN 2OUTOUTOUT5 FILOIN 1IN 2OUTIN 3OUT
Sample Output
122112None23
#include<stdio.h>#include<string.h>#include<stack>#include<queue>using namespace std;int main(){int n;char str[2][10]={"FIFO","FILO"}; //队列 栈scanf("%d",&n);while(n--){int line;char op[10];scanf("%d %s",&line,op);if(strcmp(op,"FIFO")==0){queue<int> q;for(int i=0;i<line;i++){getchar();char str[10]={0};int m;scanf("%s",str);if(strcmp(str,"IN")==0){scanf("%d",&m);q.push(m);}else{if(q.empty())printf("None\n");else{printf("%d\n",q.front());q.pop();}}}}else{stack<int> s;for(int i=0;i<line;i++){getchar();char str[10]={0};int m;scanf("%s",str);if(strcmp(str,"IN")==0){scanf("%d",&m);s.push(m);}else{if(s.empty())printf("None\n");else{printf("%d\n",s.top());s.pop();}}}}} return 0;}
阅读全文
0 0
- ACboy needs your help again!
- ACboy needs your help again!
- Acboy needs your help again!
- ACboy needs your help again!
- ACboy needs your help again!
- ACboy needs your help again!
- ACboy needs your help again! hdu1702
- hdu1702(ACboy needs your help again!)
- HDU 1702 ACboy needs your help again!
- HDU1702:ACboy needs your help again!
- HDU 1702 ACboy needs your help again!
- hdu 1702 ACboy needs your help again!
- HDU-ACboy needs your help again!-1702
- hdu 1702 ACboy needs your help again
- HDU 1702 ACboy needs your help again!
- HDU-1702-ACboy needs your help again!
- HDU 1702 ACboy needs your help again!
- 杭电ACboy needs your help again!
- Tomcat源码解析(10)
- EditText内容的动态监听方法
- 火狐浏览器httpRequest插件
- 区块链3.0(三): 去中心化的域名系统Namecoin
- CodeForces 731A Night at the Museum
- ACboy needs your help again!
- POJ 1797Heavy Transportation(dijkstral变形)
- IView中on-change属性的使用
- js复制到剪贴板
- 关闭笔记本电脑触控板的方法
- Ubuntu用户和组以及权限
- DB2 with实现递归
- docker 中不能用vim编辑文件
- 用Python学《微积分B》(不定积分的概念)