专题二1020

*题意

*解题思路

一道深度优先搜索的水题，只要使劲搜索就行了

*AC源码

 # include<iostream>

 # include<cmath>

using namespace std;

const int MAXN = 21;

int vis[MAXN], maze[MAXN];

int n, k = 1;

bool pri(int a, int b)

{

    int c = a +b;

    for (int i = 2; i<= sqrt(c); ++i)

    {

       if (c % i == 0)

       return false;

    }

    returntrue;

}

void DFS(int cur)

{

    if (cur == n &&pri(1, maze[n - 1]))

    {

           cout<<maze[0];

           int i;

           for (i = 1; i < n;++i)

           {

              cout<<''<<maze[i];

           }

           cout<<endl;

    }

    else

    {

        int i;

        for (i = 2; i<= n; ++i)

        {

           if (true == vis[i] || !pri(maze[cur - 1],i))

           {

                   continue;

           }

           maze[cur] = i;

           vis[i] = true;

           DFS(cur + 1);

           vis[i] = false;

        }

    }

}

int main()

{

    maze[0] =1;

    memset(vis,false,sizeof(vis));

    while(cin>>n)

    {

        cout<<"Case"<<k++<<':'<<endl;

         DFS(1);

        cout<<endl;

    }

    return0;

}

Prime Ring Problem

Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 79   Accepted Submission(s) : 37

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.<br><br>Note: the number of first circle should always be 1.<br><br><img src=../../data/images/1016-1.gif><br>

 

Input

n (0 < n < 20).<br>

 

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.<br><br>You are to write a program that completes above process.<br><br>Print a blank line after each case.<br>

 

Sample Input

   
   

    
    6<br>8<br>
   
   

 

Sample Output

   
   

    
    Case 1:<br>1 4 3 2 5 6<br>1 6 5 2 3 4<br><br>Case 2:<br>1 2 3 8 5 6 7 4<br>1 2 5 8 3 4 7 6<br>1 4 7 6 5 8 3 2<br>1 6 7 4 3 8 5 2<br>
   
   

 

Source

Asia 1996, Shanghai (Mainland China)

 

Statistic |  Submit |  Back