1195: Prime Ring Problem
Result | TIME Limit | MEMORY Limit | Run Times | AC Times | JUDGE |
---|---|---|---|---|---|
10s | 8192K | 1725 | 447 | Standard |
A ring is composed of n circles as shown in diagram. Put natural numbers 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 <= 16)
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.
You are to write a program that completes above process.
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
This problem is used for contest: 102 150
#include<iostream>
#include<string.h>
using namespace std;
int n;
int prime[100]={0};//素数是0
void PrimeRing(int c,int step,int visit[],int result[])
{
int i;
if(step==n)
{
if(prime[result[step]+result[1]]==0 && n != 1)
{
for( i = 1; i < n; i++)
{
cout << result[i] << " ";
}
cout << result[n] << endl;
}
return;
}
for( i = c + 1; i <= 40; i++ )
{
if( prime[i]==0 )
{
int k = i - c;
if(k <= n && !visit[k])
{
step++; //it is important
result[step] = k; //it is important
visit[k] = true; //it is important
PrimeRing( k, step, visit, result);
visit[k] = false; //it is important
step--; //it is important
}
}
}
}
int main()
{
int i,j;
int visit[30];
int result[30];
for(i=2;i<=10;i++)
{
if(prime[i]==0)
for(j=i*i;j<100;j+=i)
prime[j]=1;
}
int count=1;
while(scanf("%d",&n)==1)
{
cout << "Case " << count << ":" << endl;
memset(visit,0,sizeof(visit));
visit[1]=1;
result[1]=1;
PrimeRing(1,1,visit,result);
printf("/n");
count++;
}
return 0;
}