杭电1702ACboy needs your help again!

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
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   这是一道简单的栈和队列的应用题，题目很简单，FIFO就是队列，FILO就是栈，很简单的一道题；不过不是水题，这样的题挺好的.
  
  
  
  

   
   一直感觉着栈和队列学不会，没想到一遍就a了，看来还是能学会的，以后加倍努力。

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

  
  

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