POJ1028 模拟,水
2016-05-17 00:21
337 查看
0)
题意:模拟栈的操作。水。考验编码速度。
1)
2)
Description
Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be reached by moving backward and
forward. In this problem, you are asked to implement this.
The following commands need to be supported:
BACK: Push the current page on the top of the forward stack. Pop the page from the top of the backward stack, making it the new current page. If the backward stack is empty, the command is ignored.
FORWARD: Push the current page on the top of the backward stack. Pop the page from the top of the forward stack, making it the new current page. If the forward stack is empty, the command is ignored.
VISIT : Push the current page on the top of the backward stack, and make the URL specified the new current page. The forward stack is emptied.
QUIT: Quit the browser.
Assume that the browser initially loads the web page at the URL http://www.acm.org/
Input
Input is a sequence of commands. The command keywords BACK, FORWARD, VISIT, and QUIT are all in uppercase. URLs have no whitespace and have at most 70 characters. You may assume that no problem instance requires more than 100 elements
in each stack at any time. The end of input is indicated by the QUIT command.
Output
For each command other than QUIT, print the URL of the current page after the command is executed if the command is not ignored. Otherwise, print "Ignored". The output for each command should be printed on its own line. No output
is produced for the QUIT command.
Sample Input
Sample Output
题意:模拟栈的操作。水。考验编码速度。
1)
#include <iostream> #include <stdio.h> #include <string.h> #include <math.h> #include <stack> using namespace std; int main() { stack <string> houtui; stack <string> qianjin; string command; string url; string cur="000"; cur="http://www.acm.org/"; while(cin>>command&&command!="QUIT"){ if(command[0]=='V'){ cin>>url; cout<<url<<endl; if(cur!="000") houtui.push(cur); while(!qianjin.empty()){ qianjin.pop(); } cur=url; } else if(command[0]=='B'){ if(!houtui.empty()){ if(cur!="000") qianjin.push(cur); cur=houtui.top(); houtui.pop(); cout<<cur<<endl; } else{ cout<<"Ignored"<<endl; } } else if(command[0]=='F'){ if(!qianjin.empty()){ if(cur!="000") houtui.push(cur); cur=qianjin.top(); qianjin.pop(); cout<<cur<<endl; } else{ cout<<"Ignored"<<endl; } } } return 0; }
2)
Description
Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be reached by moving backward and
forward. In this problem, you are asked to implement this.
The following commands need to be supported:
BACK: Push the current page on the top of the forward stack. Pop the page from the top of the backward stack, making it the new current page. If the backward stack is empty, the command is ignored.
FORWARD: Push the current page on the top of the backward stack. Pop the page from the top of the forward stack, making it the new current page. If the forward stack is empty, the command is ignored.
VISIT : Push the current page on the top of the backward stack, and make the URL specified the new current page. The forward stack is emptied.
QUIT: Quit the browser.
Assume that the browser initially loads the web page at the URL http://www.acm.org/
Input
Input is a sequence of commands. The command keywords BACK, FORWARD, VISIT, and QUIT are all in uppercase. URLs have no whitespace and have at most 70 characters. You may assume that no problem instance requires more than 100 elements
in each stack at any time. The end of input is indicated by the QUIT command.
Output
For each command other than QUIT, print the URL of the current page after the command is executed if the command is not ignored. Otherwise, print "Ignored". The output for each command should be printed on its own line. No output
is produced for the QUIT command.
Sample Input
VISIT http://acm.ashland.edu/ VISIT http://acm.baylor.edu/acmicpc/ BACK BACK BACK FORWARD VISIT http://www.ibm.com/ BACK BACK FORWARD FORWARD FORWARD QUIT
Sample Output
http://acm.ashland.edu/ http://acm.baylor.edu/acmicpc/ http://acm.ashland.edu/ http://www.acm.org/ Ignored http://acm.ashland.edu/ http://www.ibm.com/ http://acm.ashland.edu/ http://www.acm.org/ http://acm.ashland.edu/ http://www.ibm.com/ Ignored
相关文章推荐
- 解决block循环引用的三种方法
- 白话设计——浅淡ISP
- ButterKnife完全解析
- fedora9安装中文输入法并调试
- python处理json格式的文件
- 1 介绍
- hibernate注解
- 回溯法与树的遍历
- 报错:constructors not allowed a return type
- POJ1008 模拟
- js原型和原型链个人理解(我的理解)
- 两串前缀最长后缀
- HLMT5Canvas标签五星制作
- 3.2白化
- [代码题]Simple_Virtual_World
- flask-admin章节五:wtforms FormField超级炫酷使用
- android开发笔记之自定义组合控件
- 属性动画(property)
- hibernate学习(1)
- 原型模式-c++实现