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

            comiz

            2007年11月4日

            a problem of maze

            Problem Statement

            People enjoy mazes, but they also get them dirty. Arrows, graffiti, and chewing gum are just a few of the souvenirs people leave on the walls. You, the maze keeper, are assigned to whiten the maze walls. Each face of the wall requires one liter of paint, but you are only required to paint visible faces. You are given a map of the maze, and you must determine the amount of paint needed for the job.

            The maze is described by a vector <string> maze, where each character can be either '#' (a wall) or '.' (an empty space). All '.' characters on the perimeter of the map are considered entrances to the maze. Upon entering the maze, one can only move horizontally and vertically through empty spaces, and areas that are not reachable by these movements are not considered visible. Each '#' represents a square block with four wall faces (each side of the square is a face). A face is visible if it is not directly adjacent to another wall (and is in a reachable area of the maze). For example, two adjacent blocks can have at most six visible faces since two of their faces are directly adjacent to each other. All exterior faces on the perimeter are considered visible.

            For example, the following picture represents a trivial maze with just one (wide) entrance and only four empty reachable spaces:

             TroytownKeeper.png

            To whiten this maze you must paint the faces highlighted in yellow above: 16 for its perimeter, plus 8 interior faces. Note that there are faces that are not visible and thus need not be painted.

            Definition     

            Class: TroytownKeeper

            Method: limeLiters Parameters: vector <string>

            Returns: int

            Method signature: int limeLiters(vector <string> maze)

            (be sure your method is public)     

            Constraints

            - maze will contain between 1 and 50 elements, inclusive.

            - Each element of maze will contain between 1 and 50 characters, inclusive.

            - All elements of maze will have the same number of characters.

            - All characters in maze will be either '.' or '#' . Examples 0)  

             

               

            {"##..#",
            "#.#.#",
            "#.#.#",
            "#####"}
            Returns: 24

            posted @ 2007-11-04 19:35 comiz 閱讀(408) | 評論 (1)編輯 收藏

            2007年10月24日

            一道基礎題

            12,…,99個數(shù)分成三組,分別組成三個三位數(shù),且使這三個三位數(shù)構成

               123的比例,試求出所有滿足條件的三個三位數(shù)。

               例如:三個三位數(shù)192,384,576滿足以上條件。
            題目比較基礎,自己用的回朔法,萬里高樓平地起,慢慢來吧...
            /* Note:Your choice is C IDE */
            #define null 0
            #include "stdio.h"
            void inject(int N,int *nNum)
            {
                int sum[3],i,j,k;
                if(N==0)
                {
                    sum[0]=*nNum*100+*(nNum+1)*10+*(nNum+2);
                    sum[1]=*(nNum+3)*100+*(nNum+4)*10+*(nNum+5);
                    sum[2]=*(nNum+6)*100+*(nNum+7)*10+*(nNum+8);
                    if(((sum[0]<<1)==sum[1])&&((3*sum[0])==sum[2]))
                    {
                        printf("we have one of them:");   
                        printf("%d,%d,%d\n",sum[0],sum[1],sum[2]);
                    }
                }
                else
                {
                    for(j=0;j<9;j++)
                    {
                        if(*(nNum+j)==null)
                        {
                            *(nNum+j)=N;
                            inject(N-1,nNum);
                            *(nNum+j)=null;
                        }
                    }
                }
            }
            main()
            {
                int k;
                int Num[9];
                for(k=0;k<9;k++)
                {
                    Num[k]=null;   
                }
                    inject(9,Num);
            }

            posted @ 2007-10-24 18:22 comiz 閱讀(213) | 評論 (0)編輯 收藏

            僅列出標題  
            <2025年6月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345

            導航

            統(tǒng)計

            常用鏈接

            留言簿(1)

            隨筆檔案

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            国产精品久久久久久久久鸭| 久久国产高清字幕中文| 久久久久久久久久久免费精品| 久久久久久久综合日本亚洲| 久久国产精品视频| 久久伊人中文无码| 亚洲日本va午夜中文字幕久久| 2021国产精品久久精品| 久久99热精品| 久久久久亚洲国产| 久久这里只有精品久久| 日韩精品无码久久一区二区三| 亚洲成色www久久网站夜月| 国产成人精品久久亚洲高清不卡 国产成人精品久久亚洲高清不卡 国产成人精品久久亚洲 | 久久只这里是精品66| 久久精品一本到99热免费| 久久无码一区二区三区少妇| 人妻无码αv中文字幕久久| 午夜精品久久久内射近拍高清 | 精品久久一区二区三区| 香蕉久久永久视频| 久久久国产精品福利免费| 久久99热这里只有精品国产| 国产精品久久久久一区二区三区| 亚洲国产精品无码久久一线| 色8激情欧美成人久久综合电| 国产精品毛片久久久久久久| 久久夜色精品国产噜噜亚洲a| 久久精品国产精品亜洲毛片| 99久久超碰中文字幕伊人| 久久久精品国产sm调教网站| 亚洲国产日韩综合久久精品| 久久er国产精品免费观看8| 久久w5ww成w人免费| 久久精品无码专区免费东京热| 精品一二三区久久aaa片| 久久久久亚洲国产| 久久婷婷五月综合97色直播| 久久国产欧美日韩精品| 无码精品久久久天天影视| 亚洲精品无码久久久久去q|