素数环（hdu 1016） (简单dfs)

Prime Ring Problem

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

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

Source

Asia 1996, Shanghai (Mainland China)

剪枝,剪枝,剪枝

#include<bits/stdc++.h>
using namespace std;
const int prime[38]= {0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1};
int vis[20],n,curr,p[20];
void dfs(int curr)
{
    if(curr==n&&prime[1+p[n-1]])
    {
        printf("1");
        for(int i=1;i<n;i++)
            printf(" %d",p[i]);
        printf("\n");
    }
    for(int i=2;i<=n;i++)
    {
        if(!vis[i]&&prime[i+p[curr-1]])
        {
            p[curr]=i;
            vis[i]=1;
            dfs(curr+1);
            vis[i]=0;
        }
    }
}
int main()
{
    int kcase=0;
    while(scanf("%d",&n)==1)
    {
        printf("Case %d:\n",++kcase);
        memset(vis,0,sizeof(vis));
        p[0]=1;
        dfs(1);
        printf("\n");
    }
    return 0;
}