1 A - ACboy needs your help again!
2017-07-25 20:36
204 查看
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!
InputThe 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.
OutputFor 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
Sample Output
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!
InputThe 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.
OutputFor 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
4 4 FIFO IN 1 IN 2 OUT OUT 4 FILO IN 1 IN 2 OUT OUT 5 FIFO IN 1 IN 2 OUT OUT OUT 5 FILO IN 1 IN 2 OUT IN 3 OUT
Sample Output
1 2 2 1 1 2 None 2 3
#include <iostream> #include <cstdio> #include <string.h> #include <queue> #include <stack> using namespace std; void que_ex(int n) { queue<int> Q; char s[10]; int a; while(n--) { scanf("%s",s); if(!strcmp(s,"IN")) { scanf("%d",&a); Q.push(a); } else if(!strcmp(s,"OUT")) { if(Q.empty()) printf("None\n"); else { printf("%d\n",Q.front()); Q.pop(); } } } } void sta_ex(int n) { stack<int> S; char s[10]; int a; while(n--) { scanf("%s",s); if(!strcmp(s,"IN")) { scanf("%d",&a); S.push(a); } else if(!strcmp(s,"OUT")) { if(S.empty()) printf("None\n"); else { printf("%d\n",S.top()); S.pop(); } } } } int main() { int n; while(~scanf("%d",&n)) { while(n--) { int m; char str[100]; scanf("%d%s",&m,str); if(!strcmp(str,"FIFO")) que_ex(m); else if(!strcmp(str,"FILO")) sta_ex(m); else printf("error\n"); } } return 0; }
相关文章推荐
- ACboy needs your help again!(简单栈)
- ACboy needs your help again! 队列和栈的应用
- ACboy needs your help again!--hdu1702
- hdu 1702 ACboy needs your help again!
- (hdu step 8.1.1)ACboy needs your help again!(STL中栈和队列的基本使用)
- ACboy needs your help again!(栈和队列简单应用)
- hdoj 1702 ACboy needs your help again!
- ACboy needs your help again!
- Acboy needs your help again!
- A - ACboy needs your help again!
- ACboy needs your help again!
- ACboy needs your help again!(杭电1702)(栈和队列的基础应用)
- hdu-1702-ACboy needs your help again!
- HDOJ1702 ACboy needs your help again!
- hdoj 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!(1702)
- C - ACboy needs your help again!
- A - ACboy needs your help again!