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

            ACM___________________________

            ______________白白の屋
            posts - 182, comments - 102, trackbacks - 0, articles - 0
            <2010年8月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            2930311234

            常用鏈接

            留言簿(24)

            隨筆分類(332)

            隨筆檔案(182)

            FRIENDS

            搜索

            積分與排名

            最新隨筆

            最新評論

            閱讀排行榜

            評論排行榜

            題目地址:
            http://acm.hdu.edu.cn/showproblem.php?pid=1016
            題目描述:

            Prime Ring Problem

            Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
            Total Submission(s): 6150    Accepted Submission(s): 2745


            Problem Description
            A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.

            Note: the number of first circle should always be 1.


            Input
            n (0 < n < 20).

            Output
            The output format is shown as sample below. Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. Print solutions in lexicographical order.

            You are to write a program that completes above process.

            Print a blank line after each case.

            Sample Input
            6 8

            Sample Output
            Case 1: 1 4 3 2 5 6 1 6 5 2 3 4 Case 2: 1 2 3 8 5 6 7 4 1 2 5 8 3 4 7 6 1 4 7 6 5 8 3 2 1 6 7 4 3 8 5 2
            題目分析:
            典型的 DFS 題目, 不需要 什么剪枝, 直接 窮舉 + 回溯 就OK了, 不過值得一提的是,這題輸出很BT, 一般的 前后 輸出 回車 , 第一個回車用 if( n == 1 ) 回車; 來做PE了好幾次, 最后直接在程序最后 輸出2個回車符竟然就A了, YM啊...........
            代碼如下:
            /* MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋 http://www.shnenglu.com/MiYu Author By : MiYu Test : Program : */ #include <iostream> using namespace std; bool prim[25]; int res[25]; bool hash[25]; int N; void setPrim () { memset ( prim, 0, sizeof ( prim ) ); prim[2] = prim[3] = prim[5] = prim[7] = prim[11] = prim[13] = prim[17] = prim[19] = prim[23] = true; } bool DFS ( int num , int n ) { res[n] = num; if ( n > N ) { return false; } if ( n == N - 1 ) { for ( int i = 2; i <= N; ++ i ) { if ( prim[num + i] && prim[ i + 1 ] && !hash[i] ) { res[n+1] = i; for ( int i = 1; i <= N; ++ i ) printf ( i == 1 ? "%d" : " %d",res[i] ); putchar ( '\n' ); } } } for ( int i = 2; i <= N; ++ i ) { if ( prim[ num + i ] && !hash[i] ) { hash[i] = true; DFS ( i, n + 1 ); hash[i] = false; } } return false; } int main () { setPrim (); int ca = 1; while ( cin >> N ) { sizeof ( hash, 0 , sizeof ( hash ) ); printf ( "Case %d:\n",ca++ ); hash[1] = true; DFS ( 1, 1 ); putchar ( '\n' ); } return 0; }

            亚洲精品午夜国产VA久久成人| 久久99国产精品久久99小说 | 四虎国产精品免费久久久| AAA级久久久精品无码片| 国产成人精品久久一区二区三区av| 2020最新久久久视精品爱| 伊人久久成人成综合网222| 欧美精品久久久久久久自慰| 亚洲va久久久噜噜噜久久狠狠| 久久久精品人妻一区二区三区四 | 香港aa三级久久三级| 国产精品久久久久蜜芽| 天天久久狠狠色综合| 亚洲精品无码专区久久久| 很黄很污的网站久久mimi色 | 中文字幕久久精品| 99久久人妻无码精品系列蜜桃| 人妻无码久久精品| 久久午夜电影网| 久久天天躁狠狠躁夜夜96流白浆 | 亚洲精品第一综合99久久| 久久777国产线看观看精品| 久久人人爽人人爽人人爽| 久久久WWW成人| 国产99久久精品一区二区| 久久精品国产2020| 区亚洲欧美一级久久精品亚洲精品成人网久久久久 | 18岁日韩内射颜射午夜久久成人| 一本色道久久88精品综合| 婷婷国产天堂久久综合五月| 久久99国产精品成人欧美| 99热都是精品久久久久久| 久久久久久久尹人综合网亚洲 | 久久久久久国产精品美女| 久久亚洲中文字幕精品一区四| 国产精品岛国久久久久| 久久精品一本到99热免费| 日日躁夜夜躁狠狠久久AV| 久久男人Av资源网站无码软件| 欧美va久久久噜噜噜久久| 久久九九兔免费精品6|