Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39611 Accepted Submission(s): 17453
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.
Note: the number of first circle should always be 1.
![](https://i-blog.csdnimg.cn/blog_migrate/427b1dd2282412709d583cc17eda983e.gif)
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.
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 21 6 7 4 3 8 5 2
#include<iostream> #include<cstring> #define MAX 50 using namespace std; int n; int vis[MAX]; int is_prime[MAX]; int a[MAX]; void dfs(int c) { a[0]=1; int i; if(c==n&&is_prime[a[0]+a[n-1]]!=0) { for(i=0;i<n-1;i++) cout<<a[i]<<" "; cout<<a[n-1]<<endl; } else { for(i=2;i<=n;i++) { if(vis[i]==0&&is_prime[i+a[c-1]]!=0) { vis[i]=1; a[c]=i; dfs(c+1); vis[i]=0; } } } } int main() { int t,i,j; t=1; for(i=2;i<50;i++) is_prime[i]=i; for(i=2;i<9;i++) { for(j=i+i;j<50;j=j+i) { is_prime[j]=0; } } while(cin>>n&&n) { cout<<"Case "<<t++<<":"<<endl; if(n%2==0) { memset(vis,0,sizeof(vis)); dfs(1); cout<<endl; } else cout<<"No Answer"<<endl; } return 0; } 思想是:深搜加回溯