A

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!
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.
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

    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

题意：按要求输出一个对列或者栈；

思路：FIFO为队列，FILO为栈，基本操作，没什么说的；基础题；

下面附上代码：

#include<cstdio>#include<algorithm>#include<queue>#include<stack>#include<cstring>using namespace std;int main(){int t;scanf("%d",&t);while(t--){int a,b,l;char o[10];char m[10];queue<int> q;stack<int> s;memset(o,0,sizeof(o));scanf("%d%s",&a,m);if(!strcmp(m,"FIFO")){for(int i=0;i<a;i++){scanf("%s",o);if(!strcmp(o,"IN")){scanf("%d",&b);q.push(b); }else{if(!q.empty()){l=q.front();q.pop();printf("%d\n",l);}elseputs("None");}}}if(!strcmp(m,"FILO")){for(int i=0;i<a;i++){scanf("%s",o);if(!strcmp(o,"IN")){scanf("%d",&b);s.push(b); }else{if(!s.empty()){l=s.top();s.pop();printf("%d\n",l);}elseputs("None");}}}}return 0;}