HDU OJ 1016 Prime Ring Problem （深搜）

solution：最典型的深搜，不要全排列那样做，要合理减枝，不然会超时

#include <iostream>
#include <cmath>
using namespace std;

int arr[20], n, cnt = 1;
bool book[21], prime_num[40];

int prime(int x)
{
	for(int i = 2; i <= sqrt(x); i++)
	{
		if(x%i==0)
		return 0;
	}
	return 1;
}

void dfs(int x)
{
	if (x == n && prime(1 + arr[n - 1])){
		printf("%d", 1);
		for (int i = 1; i < n; ++i){
			printf(" %d", arr[i]);
		}
		putchar('\n');
		return;
	}
	if (x == n)return;//就少了这行，一直output超限
	for (int i = 2; i <= n; ++i)
	{
		if (!book[i] && prime(arr[x - 1] + i)){
			book[i] = true;
			arr[x] = i;
			dfs(x + 1);
			book[i] = false;
		}
	}
}

int main()
{
	arr[0] = 1;
	book[1] = true;
	while (cin >> n){
		printf("Case %d:\n", cnt++);
 		if (n == 1)cout << 1 << endl;
		else{
			fill(book + 2, book + n, false);
			dfs(1);
		}
		putchar('\n');
	}
	return 0;
}