HDU-1702-ACboy needs your help again!

ACboy needs your help again!

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3340 Accepted Submission(s): 1721


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

Source 2007省賽集訓隊練習賽（1）

好久沒用cpp的模板庫了，今天試了下，果然挺爽的！
AC代碼：


cpp版：

#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

int main()
{
	int T;
	scanf("%d", &T);
	while(T--)
	{
		int n;
		char fun[6];
		scanf("%d %s", &n, fun);
		if(!strcmp(fun, "FIFO"))
		{
			queue q; int m; char fun1[5];
			while(n--)
			{
				scanf("%s", fun1);
				if(!strcmp(fun1, "IN")){
					scanf("%d", &m);
					q.push(m);
				}
				else if(!strcmp(fun1, "OUT")){
					if(!q.empty()) {
						printf("%d\n", q.front());
						q.pop();
					}
					else {
						printf("None\n");
					}
				}
			}
		}
		else if(!strcmp(fun, "FILO"))
		{
			stack a; int m; char fun1[5];
			while(n--)
			{
				scanf("%s", fun1);
				if(!strcmp(fun1, "IN")){
					scanf("%d", &m);
					a.push(m);
				}
				else if(!strcmp(fun1, "OUT")){
					if(!a.empty()) {
						printf("%d\n", a.top());
						a.pop();
					}
					else {
						printf("None\n");
					}
				}
			}
		}
	}
	return 0;
} 

C版：

#include 
#include 

int list[10001];
int first, last;

void push(int a)
{
    list[last++]=a;
}

int get_s()
{
    return list[--last];
}

int get_q()
{
    return list[first++];
} 

int main()
{
    int i, j, t, n, m;
    char str[10];
    scanf("%d", &n);
    while(n--)
    {
        scanf("%d %s", &m, str);
        first=last=0;
        if(strcmp(str, "FIFO")==0)
        {
            for(j=0; j