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

            隨筆檔案

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            久久亚洲AV成人无码国产| 久久久亚洲精品蜜桃臀| 久久久精品日本一区二区三区| 一本久久a久久精品综合夜夜| 99久久婷婷国产一区二区| 久久精品国产亚洲综合色| 国产精品青草久久久久福利99 | 久久精品黄AA片一区二区三区| 久久男人Av资源网站无码软件| 成人国内精品久久久久影院| 亚洲成av人片不卡无码久久| 久久国产精品成人片免费| 国产香蕉97碰碰久久人人| 久久青青草原亚洲av无码app| 久久精品国产69国产精品亚洲| 久久久久久国产精品无码下载| 99蜜桃臀久久久欧美精品网站| 99精品久久精品一区二区| 国产激情久久久久影院老熟女免费| 97视频久久久| 女同久久| 国产Av激情久久无码天堂| 久久精品国产亚洲AV无码娇色| 国产视频久久| 亚洲精品无码久久久久去q| 国产精品乱码久久久久久软件| 久久99久久99精品免视看动漫| 亚洲午夜无码AV毛片久久| 国产精品久久久99| 久久人人爽人人爽人人AV| 日本加勒比久久精品| 91超碰碰碰碰久久久久久综合| 少妇高潮惨叫久久久久久| 伊人久久一区二区三区无码| 88久久精品无码一区二区毛片| 久久精品中文闷骚内射| 国产激情久久久久久熟女老人| 欧美激情精品久久久久久| 久久精品无码免费不卡| 青青草国产精品久久久久| 久久精品一区二区影院|