uva 524 - Prime Ring Problem(dfs)

题目链接：uva 524 - Prime Ring Problem

题目大意：给出n，用1-n来组成一个环，要求相邻的两个数之和为素数。

解题思路：dfs，注意判断最后一个和第一个数之和也要为素数。

#include <stdio.h>
#include <string.h>

const int N = 50;
const int p[N] = {0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0};

int n, v[N], vis[N];

void dfs(int d) {
	if (d == n) {
		if (p[v[n-1] + v[0]] == 1) {
			for (int i = 0; i < n - 1; i++) printf("%d ", v[i]);
			printf("%d\n", v[n - 1]);
		}
		return ;
	}

	for (v[d] = 1; v[d] <= n; v[d]++) {
		if (vis[v[d]]) continue;
		if (p[v[d] + v[d - 1]] == 0) continue;
		vis[v[d]] = 1;
		dfs(d + 1);
		vis[v[d]] = 0;
	}
}

int main () {
	int cas = 0;
	while (scanf("%d", &n) == 1) {
		if (cas) printf("\n");
		printf("Case %d:\n", ++cas);
		memset(vis, 0, sizeof(vis));
		v[0] = vis[1] = 1;
		dfs(1);
	}
	return 0;
}