/*水题
思路:要找的是一个环,所以搜索时先固定第一个数,再找其他的数。
当找到最后一个数时还要判断他与第一个数的和是否为素数。*/
#include<stdio.h>
#include<string.h>
int c[100],n,lu[100];
int pri(int x)//判断是否为素数。
{
for(int i=2;i<x;i++)
if(x%i==0)return 0;
return 1;
}
void dfs(int s)
{
if(s==n)//当遍历到c[n-1]之后,再次进入递归函数中,此时s==n。
{
if(pri(1+c[n-1]))//应该计算1和最后一个数的和是否为素数,输出结果。
{
printf("1");
for(int i=1;i<n;i++)
printf(" %d",c[i]);
printf("\n");
}
}
for(int i=2;i<=n;i++)
{
if(lu[i]==1)continue;
if(pri(i+c[s-1]))
{
lu[i]=1;
c[s]=i;
dfs(s+1);
lu[i]=0;
}
}
}
int main()
{
int f=1;
while(~scanf("%d",&n))
{
memset(lu,0,sizeof(lu));
printf("Case %d:\n",f++);
c[0]=1;//千万不要忘了定义c[0],上面有一个 pri(i+c[s-1]).
dfs(1);
printf("\n");
}
}
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
You are to write a program that completes above process.
Print a blank line after each case.
6
8
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