Web Navigation(1028)
2015-07-23 14:08
387 查看
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
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <ctype.h>
#define MaxSize 100
typedef struct
{
int Top;
int pre;
}Stack;
int main()
{ char Data[MaxSize][103];
char str[101];
char wb[101]="http://www.acm.org/";
Stack S;
Stack *Ptrs;
Ptrs=&S;
Ptrs->pre=Ptrs->Top=0;
strcpy(Data[0],wb);
while(scanf("%s",str)!=EOF)
{
if(strcmp(str,"QUIT")==0)
break;
if(str[0]=='V')
{
scanf("%s",wb);
strcpy(Data[(++Ptrs->pre)],wb);
Ptrs->Top=Ptrs->pre;
printf("%s\n",wb);
}
else if(str[0]=='B')
{
if(Ptrs->pre>0)
{
Ptrs->pre--;
printf("%s\n",Data[Ptrs->pre]);
}
else
printf("Ignored\n");
}
else if(str[0]=='F')
{
if(Ptrs->pre<Ptrs->Top)
{
Ptrs->pre++;
printf("%s\n",Data[Ptrs->pre]);
}
else
printf("Ignored\n");
}
getchar();
}
return 0;
}
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
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <ctype.h>
#define MaxSize 100
typedef struct
{
int Top;
int pre;
}Stack;
int main()
{ char Data[MaxSize][103];
char str[101];
char wb[101]="http://www.acm.org/";
Stack S;
Stack *Ptrs;
Ptrs=&S;
Ptrs->pre=Ptrs->Top=0;
strcpy(Data[0],wb);
while(scanf("%s",str)!=EOF)
{
if(strcmp(str,"QUIT")==0)
break;
if(str[0]=='V')
{
scanf("%s",wb);
strcpy(Data[(++Ptrs->pre)],wb);
Ptrs->Top=Ptrs->pre;
printf("%s\n",wb);
}
else if(str[0]=='B')
{
if(Ptrs->pre>0)
{
Ptrs->pre--;
printf("%s\n",Data[Ptrs->pre]);
}
else
printf("Ignored\n");
}
else if(str[0]=='F')
{
if(Ptrs->pre<Ptrs->Top)
{
Ptrs->pre++;
printf("%s\n",Data[Ptrs->pre]);
}
else
printf("Ignored\n");
}
getchar();
}
return 0;
}
相关文章推荐
- Linux C函数参考手册(PDF版)
- Lua教程(十七):C API简介
- C#实现打造气泡屏幕保护效果
- C/C++数据对齐详细解析
- C 语言基础教程(我的C之旅开始了)[三]
- C++中的extern “C”用法详解
- C 语言基础教程(我的C之旅开始了)[七]
- C字符串操作函数实现方法小结
- C/C++ 宏详细解析
- C/C++实现对STORM运行信息查看及控制的方法
- 用C#生成不重复的随机数的代码
- 在c和c++中实现函数回调
- 浅析C/C++中被人误解的SIZEOF
- C 语言基础教程(我的C之旅开始了)[六]
- C/C++实现的游戏角色名称名字随机生成代码
- C/C++函数调用的几种方式总结
- c/c++中变量的声明和定义深入解析
- 浅析c与c++中struct的区别
- 深入详解C编写Windows服务程序的五个步骤