• <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>

            Uriel's Corner

            Research Associate @ Harvard University / Research Interests: Computer Vision, Biomedical Image Analysis, Machine Learning
            posts - 0, comments - 50, trackbacks - 0, articles - 594

            POJ 1888 Crossword Answers---模擬

            Posted on 2009-09-03 01:48 Uriel 閱讀(317) 評論(0)  編輯 收藏 引用 所屬分類: POJ 、模擬
            模擬英語填字游戲。。關于序號處理丟了幾天突然想到。。
            最近這類模擬做了很多。。紀念下~
            /*Problem: 1888  User: Uriel 
               Memory: 292K  Time: 32MS 
               Language: C++  Result: Accepted
            */
             

            #include
            <stdio.h>
            #include
            <stdlib.h>
            #include
            <string.h>

            int g,i,j,a,b,k,x,y,syl;
            char str[20][20];

            struct M{
                
            char r[20];
                
            char c[20];
                
            int num;
                
            int flag1;
                
            int flag2;
            }
            S[2000];

            int main()
            {
                g
            =1;
                
            while(1)
                
            {
                    scanf(
            "%d",&a);
                    
            if(a==0)break;
                    scanf(
            "%d",&b);
                    
            for(i=0;i<a;i++)
                    
            {
                        getchar();
                        
            for(j=0;j<b;j++)
                        
            {
                            scanf(
            "%c",&str[i][j]);
                        }

                    }

                    x
            =1;
                    S[
            1].flag1=0;
                    S[
            1].flag2=0;
                    memset(S,
            0x00,sizeof(S));
                    
            for(i=0;i<a;i++)
                    
            {
                        
            for(j=0;j<b;j++)
                        
            {
                            syl
            =0;
                            
            if((j==0 || str[i][j-1]=='*'&& str[i][j]!='*')
                            
            {
                                syl
            =1;
                                S[x].num
            =x;
                                S[x].flag1
            =1;
                                y
            =0;
                                
            for(k=j;k<b;k++)
                                
            {
                                    
            if(str[i][k]=='*')break;
                                    S[x].r[y
            ++]=str[i][k];
                                }

                            }

                            
            if((i==0 || str[i-1][j]=='*'&& str[i][j]!='*')
                            
            {
                                syl
            =1;
                                S[x].num
            =x;
                                S[x].flag2
            =1;
                                y
            =0;
                                
            for(k=i;k<a;k++)
                                
            {
                                    
            if(str[k][j]=='*')break;
                                    S[x].c[y
            ++]=str[k][j];
                                }

                            }

                            
            if(syl)
                            
            {
                                x
            ++;
                                S[x].flag1
            =0;
                                S[x].flag2
            =0;
                            }

                        }

                    }

                    printf(
            "puzzle #%d:\n",g++);
                    printf(
            "Across\n");
                    
            for(i=0;i<x;i++)
                    
            {
                        
            if(S[i].flag1==1)
                        
            {
                            printf(
            "%3d.%s\n",S[i].num,S[i].r);
                        }

                    }

                    printf(
            "Down\n");
                    
            for(i=0;i<x;i++)
                    
            {
                        
            if(S[i].flag2==1)
                        
            {
                            printf(
            "%3d.%s\n",S[i].num,S[i].c);
                        }

                    }

                    printf(
            "\n");
                }

                system(
            "PAUSE");
                
            return 0;
            }

            久久强奷乱码老熟女网站| 国产精品欧美久久久天天影视| 国内精品久久久久久中文字幕| 久久久精品久久久久特色影视| 日产精品久久久久久久| 久久精品青青草原伊人| 国产韩国精品一区二区三区久久| 国产69精品久久久久99尤物| 中文国产成人精品久久亚洲精品AⅤ无码精品| 97视频久久久| 99久久综合国产精品二区| 狠狠综合久久AV一区二区三区| 精品999久久久久久中文字幕| 伊人久久精品影院| 久久亚洲精品视频| 日批日出水久久亚洲精品tv| 亚洲欧洲精品成人久久奇米网| 99久久国产主播综合精品| 欧美日韩精品久久久久| 日韩十八禁一区二区久久| 综合久久给合久久狠狠狠97色| segui久久国产精品| 亚洲AV无码久久精品色欲| 久久99国产综合精品女同| 狠狠色婷婷久久一区二区三区| 久久国产高清字幕中文| 欧美大香线蕉线伊人久久| 久久精品国产99久久久古代| 久久精品国产亚洲AV蜜臀色欲| 久久亚洲国产精品成人AV秋霞| 久久无码AV一区二区三区| 久久久一本精品99久久精品66| 久久电影网2021| 日韩欧美亚洲国产精品字幕久久久| 伊人久久无码精品中文字幕| 成人午夜精品无码区久久| 久久精品一区二区| 无码伊人66久久大杳蕉网站谷歌| 伊人丁香狠狠色综合久久| 三上悠亚久久精品| 亚洲乱码中文字幕久久孕妇黑人 |