• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 21, comments - 2, trackbacks - 0, articles - 0
            http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=61
            數(shù)據(jù)結(jié)構(gòu),用C寫的棧,不用STL確實(shí)復(fù)雜多了,WA了幾次~
            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 <url>: 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/


            This problem contains multiple test cases!

            The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

            The output format consists of N output blocks. There is a blank line between output blocks.


            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

            1

            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

            AC代碼:

            #include<stdio.h>
            #include
            <string.h>
            #include
            <malloc.h>
            #define StackSize 105
            typedef 
            struct
            {
                
            char elemt[StackSize][73];
                
            int top;
            }
            Stack;
            void InitStack(Stack *S)
            {
                  S
            ->top=-1;
            }

            int ElemtNum(Stack *S)
            {
                
            return (S->top)+1;
            }

            int IsFull(Stack *S)
            {
                
            return(S->top==StackSize-1?1:0);
            }

            int PushStack(Stack *S,char *x)
            {
                
            if(IsFull(S))  
                    
            return 0;
                S
            ->top++;
                memset(S
            ->elemt[S->top],'\0',sizeof(S->elemt[S->top]));
                strcpy(S
            ->elemt[S->top],x);
                
            return 1;
            }

            int PopStack(Stack *S,char *x)
            {  
                
            if(ElemtNum(S)==0)
                    
            return 0;
                memset(x,
            0,sizeof(x));
                  strcpy(x,S
            ->elemt[S->top]);
                memset(S
            ->elemt[S->top],0,sizeof(S->elemt[S->top]));
                S
            ->top--;
                  
            return 1;
            }

            int GetTopElemt(Stack *S,char *x)
            {
                
            if(ElemtNum(S)==0)
                    
            return 0;
                  memset(x,
            0,sizeof(x));
                  strcpy(x,S
            ->elemt[S->top]);
                  
            return 1;
            }

            int main()
            {
                Stack 
            *sBack,*sForward;
                sBack
            =(Stack *)malloc(sizeof(Stack));
                sForward
            =(Stack *)malloc(sizeof(Stack));
                
            int T;char str[73]="\0",comd[8]="\0",tmp[73]="\0";
                scanf(
            "%d",&T);
                
            while(T--)
                
            {
                    InitStack(sBack); InitStack(sForward);
                    PushStack(sBack,
            "http://www.acm.org/");
                    
            while(1)
                    
            {
                        memset(comd,
            0,sizeof(comd));
                        scanf(
            "%s",comd);
                        
            if(strcmp(comd,"BACK")==0)
                        
            {
                            
            if(ElemtNum(sBack)==1)
                            
            {
                                printf(
            "Ignored\n");
                                
            continue;
                            }

                            PopStack(sBack,tmp);
                            PushStack(sForward,tmp);
                            
            if(GetTopElemt(sBack,tmp)==1)
                                printf(
            "%s\n",tmp);
                        }

                        
            else if(strcmp(comd,"FORWARD")==0)
                        
            {
                            
            if(ElemtNum(sForward)==0)
                            
            {
                                printf(
            "Ignored\n");
                                
            continue;
                            }

                            PopStack(sForward,tmp);
                            PushStack(sBack,tmp);
                            
            if(GetTopElemt(sBack,tmp)==1)
                                printf(
            "%s\n",tmp);
                        }

                        
            else if(strcmp(comd,"VISIT")==0)
                        
            {
                            memset(str,
            0,sizeof(str));
                            scanf(
            "%s",str);
                            printf(
            "%s\n",str);
                            PushStack(sBack,str);
                            InitStack(sForward);
                        }

                        
            else if(strcmp(comd,"QUIT")==0)
                            
            break;
                    }

                    
            if(T>0) printf("\n");
                }

                free(sBack);free(sForward);
                
            return 0;
            }


            精品午夜久久福利大片| 久久人人爽人人爽人人片AV不| 无码国内精品久久人妻麻豆按摩| 国产香蕉久久精品综合网| 久久精品国产免费观看三人同眠| 久久99精品久久只有精品| 久久久精品视频免费观看| 日韩精品久久久肉伦网站| 青青草国产精品久久久久| 成人久久免费网站| 亚洲嫩草影院久久精品| 国产精品岛国久久久久| 久久精品国产欧美日韩99热| 久久亚洲精品无码播放| 国内精品久久久久久久97牛牛| 精品免费久久久久国产一区| 少妇久久久久久久久久| 久久这里有精品| 久久狠狠一本精品综合网| 国产91色综合久久免费| 性高湖久久久久久久久| 亚洲国产天堂久久久久久| 久久精品国产国产精品四凭| 久久97精品久久久久久久不卡| 一本色道久久综合狠狠躁| 久久精品综合网| 一本色道久久88综合日韩精品 | 久久人人爽人人爽人人片AV高清 | 久久电影网| 久久久91精品国产一区二区三区| 人人妻久久人人澡人人爽人人精品 | 香蕉99久久国产综合精品宅男自 | 99久久国产综合精品五月天喷水 | 精品99久久aaa一级毛片| 久久91精品久久91综合| 久久国产精品久久久| 大伊人青草狠狠久久| 国产69精品久久久久777| 久久精品国产半推半就| 狠狠色噜噜狠狠狠狠狠色综合久久 | 久久久久国产精品人妻|