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>
#include<math.h>
int a[100],v[100];
int n;
int fun(int x)
{
for(int i=2; i<x; i++)
{
if(x%i==0)
return 0;
}
return 1;
}
void dfs(int x)
{
if(x==n&&fun(a[0]+a[n-1])) //注意不要忘了判断第一个和最后一个
{
printf("%d",a[0]);
for(int i=1; i<n; i++)
printf(" %d",a[i]);
printf("\n");
}
for(int i=2; i<=n; i++)
{
if(v[i]==0&&fun(i+a[x-1])) //相邻两个数相加为素数
{
a[x]=i;
v[i]=1;
dfs(x+1);
v[i]=0;
}
}
}
int main()
{
int un=0;
while(~scanf("%d",&n))
{
printf("Case %d:\n",++un);
memset(a,0,sizeof(a));
memset(v,0,sizeof(v));
a[0]=1;
dfs(1);
printf("\n");
}
return 0;
}