HDU 1072 ACboy needs your help again!(栈和队列)

ACboy needs your help again!

#include<stdio.h>
#include<stack>
#include<queue>
using namespace std;

int main()
{
stack<int>s;
queue<int>q;

int t,n,a;
char str[5],str1[5];   //利用数组存储
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
scanf("%s",str);
while(!q.empty())	//注意，要将栈和队列先制空
q.pop();
while(!s.empty())
s.pop();
while(n--)
{
scanf("%s",str1);
if(str1[0]=='I'&&str[2]=='F')   // 单个字符
{
scanf("%d",&a);
q.push(a);
}
if(str1[0]=='I'&&str[2]=='L')
{
scanf("%d",&a);
s.push(a);
}
if(str1[0]=='O'&&str[2]=='F')
{
if(!q.empty())
{
printf("%d\n",q.front());
q.pop();
}
else
printf("None\n");
}
if(str1[0]=='O'&&str[2]=='L')
{
if(!s.empty())
{
printf("%d\n",s.top());
s.pop();
}
else
printf("None\n");
}
}
}
return 0;
}

#include <iostream>
#include<stdio.h>
#include <string>
#include <queue>
#include <stack>
using namespace std;

int main()
{
stack<int> s;
queue<int> q;

string str, str1;    //c++ 里面直接定义字符串
int t,n,a;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
cin>>str;
while(!q.empty())
q.pop();
while(!s.empty())
s.pop();
while(n--)
{
cin>>str1;
if((str1=="IN")&&(str=="FIFO"))    //直接比较字符串
{
scanf("%d",&a);
q.push(a);
}

if((str1=="IN")&&(str=="FILO"))
{
scanf("%d",&a);
s.push(a);
}

if((str1=="OUT")&&(str=="FIFO"))
{
if(!q.empty())
{
printf("%d\n",q.front());
q.pop();
}
else
printf("None\n");
}
if((str1=="OUT")&&(str=="FILO"))
{

if(!s.empty())
{
printf("%d\n",s.top());
s.pop();
}
else
printf("None\n");

}
}
}
return 0;
}