暑期集训之ACboy needs your help again!

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

这道题首次接触到栈和队列的知识，虽然开始不是很懂，但后来看了下别人的博客也算是成了自己的知识了，这道题用到了模拟的思想（虽然表示不是很懂这种思想，不过好像就是按着题目要求一步一步来）所以，基于这种思想，我们也可以一步一步的实现他所要求的东西，不过这道题要注意的是q.empty()这个操作，它表示如果是空的话返回值是真，不要搞混了当然学长也是给出了一些常用的栈和队列操作，地址如下：

栈和队列的常用操作

除此之外也就没啥了，主要还是模拟栈和队列，代码如下（还是挺好懂得，就是一步一步的来）：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	while(n--)
	{
		int m;
		char str[10];
		char p[10];
		int tmp;
		scanf("%d %s",&m,str);
		if(!strcmp(str,"FIFO"))
		{   queue<int > q;
			for(int i=0;i<m;i++)
		{
			scanf("%s",p);
			if(!strcmp(p,"IN"))
			{
				scanf("%d",&tmp);
				q.push(tmp);
			}
			else if(!strcmp(p,"OUT"))
			{
				if(q.empty())
				printf("None\n");
				else
				{
					printf("%d\n",q.front());
					q.pop();
				}
			}
			}
		}
		else if(!strcmp(str,"FILO"))
		{
			stack<int > q;
				for(int i=0;i<m;i++)
		{
			scanf("%s",p);
			if(!strcmp(p,"IN"))
			{
				scanf("%d\n",&tmp);
				q.push(tmp);
			}
			else if(!strcmp(p,"OUT"))
			{
				if(q.empty())
                 printf("None\n");
                 else
                 {
                 	printf("%d\n",q.top());
                 	q.pop();
				 }
				 }
			}
		}
	}
	return 0;
}