• <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 閱讀(409) | 評論 (1)編輯 收藏

            2007年10月24日

            一道基礎題

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

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

               例如:三個三位數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年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            導航

            統計

            常用鏈接

            留言簿(1)

            隨筆檔案

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            欧美久久久久久午夜精品| 久久激情五月丁香伊人| 国产精品乱码久久久久久软件 | 久久精品国产99久久久| 久久ZYZ资源站无码中文动漫| AV无码久久久久不卡网站下载| 麻豆精品久久久一区二区| 欧美与黑人午夜性猛交久久久 | 青青草原综合久久| 久久99精品九九九久久婷婷| 色妞色综合久久夜夜| 久久亚洲综合色一区二区三区| 精品国产乱码久久久久软件| 国产精品美女久久久久| 久久久久久久91精品免费观看| 成人国内精品久久久久一区| 亚洲精品国产第一综合99久久| 久久线看观看精品香蕉国产| 狠狠色婷婷久久一区二区 | 色偷偷88888欧美精品久久久| 91精品国产色综久久| 久久久无码一区二区三区 | 欧美久久综合性欧美| 精品国产青草久久久久福利| 久久福利片| 国产精品99久久久久久宅男 | 亚洲午夜无码久久久久| 欧美一级久久久久久久大片| 久久e热在这里只有国产中文精品99 | 996久久国产精品线观看| 97精品国产97久久久久久免费 | 2020国产成人久久精品| 久久久久国产视频电影| 成人精品一区二区久久久| 天天爽天天爽天天片a久久网| 国产成人久久精品一区二区三区 | 国产午夜精品久久久久九九| 伊人久久大香线蕉精品| 亚洲午夜精品久久久久久人妖| 97久久超碰国产精品旧版| 久久99精品国产一区二区三区|