Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32851 Accepted Submission(s): 14537
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.
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
题目大意:
给定一个n,要求用1~n这n个数构成一个素数环,即相邻两个数之和为素数,若有多种情况,按照字典序输出;
#include<iostream>
#include<cstring>
using namespace std;
int book[22];
int shuliang;
int n;
int sushuhuan[22];
bool issushu(int a)
{
for (int i = 2;i <= a / 2;i++)
{
if (a%i == 0)
return false;
}
return true;
}
void DFS(int a)
{
if (n == shuliang&&issushu(a + 1))
{
for (int i = 1;i <= n;i++)
cout << sushuhuan[i] <<( i != n ? ' ' : '\n');
return;
}
for (int i = 2;i <= n;i++)
{
if (book[i] == 0 && issushu(a + i))
{
book[i] = 1;
shuliang++;
sushuhuan[shuliang] = i;
DFS(i);
book[i] = 0;
shuliang--;
}
}
}
int main()
{
int casen = 0;
while (cin >> n)
{
casen++;
memset(book, 0, sizeof(book));
memset(sushuhuan, 0, sizeof(sushuhuan));
sushuhuan[1] = 1;
shuliang = 1;
book[1] = 1;
if (casen == 1)
cout << "Case 1:" << endl;
else
cout << "Case " << casen << ":" << endl;
DFS(1);
cout << endl;
}
return 0;
}