HDOJ1016
题目
代码
#include<iostream>
#include<algorithm>
#include<cstring>
#include<math.h>
#include<cstdio>
using namespace std;
int n;
int a[25], book[25];
bool judge_prime(int m)
{
int i;
for(i=2;i<=sqrt(m);i++)
{
if(m%i==0)
{
return false;
}
}
return true;
}
void dfs(int step)
{
if(step==n+1)
{
if(judge_prime(a[n]+1))
{
for(int i=1;i<=n;i++)
{
if(i==1)
{
cout<<a[1];
}
else
{
cout<<" "<<a[i];
}
}
cout<<endl;
return;
}
return;
}
for(int i=2;i<=n;i++)
{
if(book[i]==0)
{
if(judge_prime(a[step-1]+i))
{
a[step] = i;
book[i] = 1;
}
else
{
continue;
}
dfs(step+1);
book[i] = 0;
}
}
}
int main()
{
a[1] = 1;
int T = 1;
while(cin>>n)
{
cout<<"Case "<<T<<":"<<endl;
memset(book, 0, sizeof(book));
dfs(2);
cout<<endl;
T++;
}
}
Conclusion
这道题和hdoj1015类似。