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
Inputcopy | Outputcopy |
---|---|
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 |
#include<iostream>
#include<string.h>
typedef long long ll;
#define endl '\n'
#define buff ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
using namespace std;
int n,tot;
int vis[29];
int a[29];
bool su(int x)
{
for(int i=2;i*i<=x;i++)
{
if(x%i==0) return 0;
}
return 1;
}
void dfs(int x)
{
if(x==n+1)
{
tot++;
for(int i=1;i<=n;i++) cout<<a[i]<<' ';
cout<<'\n';
return ;
}
else if(x==1)
{
vis[1]=1;
a[1]=1;
dfs(x+1);
}
else if(x==n)
{
for(int i=2;i<=n;i++)
{
if(vis[i]==0)
{
if(su(i+a[x-1])&&su(1+i))
{
vis[i]=1;
a[x]=i;
dfs(x+1);
vis[i]=0;
a[x]=0;
}
else return ;
}
}
}
else {
for(int i=2;i<=n;i++)
{
if(vis[i]==0)
{
if(su(i+a[x-1]))
{
vis[i]=1;
a[x]=i;
dfs(x+1);
vis[i]=0;
a[x]=0;
}
}
}}
}
int main()
{
ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int case1=1;
while(cin>>n)
{
cout<<"Case "<<case1<<":"<<'\n';
tot=0;
dfs(1);
memset(vis,0,sizeof(vis));
case1++;
cout<<'\n';
}
}