ACboy needs your help again!(简单栈)
来源:互联网 发布:招生软件 编辑:程序博客网 时间:2024/06/07 03:15
//题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1702
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!InputThe 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.OutputFor 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 Input44 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT5 FIFOIN 1IN 2OUTOUTOUT5 FILOIN 1IN 2OUTIN 3OUTSample Output122112None23
#include<stdio.h>#include<string.h>int x[1001],y[1001];int main(){ int n,m,i,j,j1,j2,a,t,p,q; char w[10],s[10]; while(~scanf("%d",&n)) { memset(x,0,sizeof(x)); memset(y,0,sizeof(y)); scanf("%d",&a); scanf("%s",w); if(strcmp(w,"FIFO")==0)//先进先出 { j=0; j1=0; for(i=0;i<a;++i) { scanf("%s",s); if(strcmp(s,"IN")==0) { scanf("%d",&t); x[j++]=t; } else if(strcmp(s,"OUT")==0) { if(j1+1>j) printf("None\n"); else { y[j1]=x[j1]; printf("%d\n",y[j1]); j1++; } } } } else if(strcmp(w,"FILO")==0) //先进后出 { j2=0; p=q=0; for(i=0;i<a;++i) { scanf("%s",s); if(strcmp(s,"IN")==0) { scanf("%d",&t); x[p++]=t; j2++; } else if(strcmp(s,"OUT")==0) { if(q+1>j2) printf("None\n"); else { y[q]=x[p-1]; printf("%d\n",y[q]); q++; p--; } } } } } return 0;}
0 0
- ACboy needs your help again!(简单栈)
- ACboy needs your help again!(简单栈)
- ACboy needs your help again!(堆栈的简单应用)
- hdu1702(ACboy needs your help again!)
- ACboy needs your help again!(1702)
- HDU - 1702 - ACboy needs your help again!(栈&&队列)
- HDU 1702 ACboy needs your help again!(栈+队列)
- ACboy needs your help again! (栈、队列 模拟)
- HDU1702--ACboy needs your help again!(栈和队列)
- 【HDU】1702---ACboy needs your help again!(栈&&队列)
- ACboy needs your help again!
- ACboy needs your help again!
- Acboy needs your help again!
- ACboy needs your help again!
- ACboy needs your help again!
- ACboy needs your help again!
- HDU:1702 ACboy needs your help again!(简单栈、队列)
- ACboy needs your help again!(栈和队列简单应用)
- python2.7下安装PIL库
- UVA - 12325 Zombie's Treasure Chest
- hdu 3718Similarity(二分图最大权匹配)
- RHEL7下面安装oracle,安装界面出现方块、乱码
- 浅谈 linux 多线程编程和 windows 多线程编程的异同
- ACboy needs your help again!(简单栈)
- 《转》 Ceilometer项目源码分析----ceilometer项目源码结构分析
- Android学习笔记(0)
- 关于httpHeader和httpbody用法总结
- Android电池驱动(二)(自用)
- OC对象和属性
- Python中的lambda
- 循环报数
- 关于@property的一些小总结