Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26303 Accepted Submission(s): 11752
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.
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 2 1 6 7 4 3 8 5 2
#include<stdio.h>
#include<string.h>
#define MAX 41
int isprime[MAX]={0,0,0,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,0,0,0};
int visit[MAX];
int n;
void dfs(int s,int count,int *A){
int i;
if(count==n){
printf("%d",A[0]);
for(i=1;i<n;i++){
printf(" %d",A[i]);
}
printf("\n");
}
else {
if(count<n-1){
for(i=2;i<=n;i++){
if(!visit[i]&&isprime[i+s]){
visit[i]=1;
A[count]=i;
dfs(i,count+1,A);
visit[i]=0;
}
}
}
else{
for(i=2;i<=n;i++){
if(!visit[i]&&isprime[i+s]&&isprime[i+1]){
visit[i]=1;
A[count]=i;
dfs(i,count+1,A);
visit[i]=0;
}
}
}
}
}
int main(){
int A[MAX];
int i=0;
while(scanf("%d",&n)!=EOF){
i++;
memset(visit,0,sizeof(visit));
printf("Case %d:\n",i);
A[0]=1;
dfs(1,1,A);
printf("\n");
}
return 0;
}