这道题是求素数环,题意不难理解,思路大家都会有,但这道题需要注意TLE,所以不能用枚举的方法,要用搜索的方法,遍历解答树,利用回溯,节省时间。关于解答树的概念可以参考《算法竞赛入门经典》(刘汝佳)P118。
此外,还要注意,由于可能存在n没有素数环,所以不能边找边输出,需要保存。还有,在输出格式上允许最后一个结果后面输出一行空格。
代码(G++):
#include <cstdlib>
#include <iostream>
#include <cmath>
using namespace std;
bool prime[40],number[20];
int array[20],n;
void dfs(int a,int c) //c从0开始计数
{
int i;
number[a]=true;
array[c++]=a;
if(c==n)
{
cout<<1;
for(i=1;i<n;i++) cout<<' '<<array[i];
cout<<endl;
return ;
}
for(i=2;i<=n;i++)
{
if(!number[i]&&prime[a+i])
{
if(c==n-1&&!prime[i+1]) continue;
dfs(i,c);
number[i]=false;
}
}
}
int main(int argc, char *argv[])
{
int i,j,t;
memset(prime,true,sizeof(prime));
for(i=2;i<=sqrt(40);i++)
{
if(prime[i])
{
for(j=i+i;j<40;j+=i) prime[j]=false;
}
}
t=1;
while(cin>>n)
{
memset(number,false,sizeof(number));
cout<<"Case "<<t++<<":"<<endl;
dfs(1,0);
cout<<endl;
}
system("PAUSE");
return EXIT_SUCCESS;
}
题目:
Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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.
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