uva 524 - Prime Ring Problem(dfs)

最新推荐文章于 2022-06-01 20:54:55 发布

原创最新推荐文章于 2022-06-01 20:54:55 发布 · 1.3k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法竞赛入门经典训练指南-第一章

搜索-回溯法

本文探讨了如何解决一个特定的数学问题——素数环问题。该问题要求使用从1到n的数字构造一个环，使得任意相邻两数之和为素数。文章通过深度优先搜索算法提供了一个有效的解决方案，并给出了完整的C语言实现代码。

Prime Ring Problem

A ring is composed of n (even number) circles as shown in diagram. Put natural numbers $1, 2, \dots, 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.

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.

You are to write a program that completes above process.

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组成一个环，每相邻两个数字相加为素数。

思路：dfs。。水

代码：

#include <stdio.h>
#include <string.h>
const int N = 20;
const int prime[32] = {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};

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

void init() {
    memset(vis, 0, sizeof(vis));
}

void dfs(int num, int now) {
    if (num == n) {
	if (prime[now + 1]) {
	    printf("%d", ans[0]);
	    for (int i = 1; i < num; i ++)
		printf(" %d", ans[i]);
	    printf("\n");
	}
	return;
    }
    for (int i = 1; i <= n; i ++) {
	if (num == 0 && i != 1) continue;
	if (!vis[i] && prime[now + i]) {
	    vis[i] = 1;
	    ans[num] = i;
	    dfs(num + 1, i);
	    vis[i] = 0;
	}
    }
}

int main() {
    int cas = 0;
    while (~scanf("%d", &n)) {
	init();
	if (cas) printf("\n");
	printf("Case %d:\n", ++cas);
	if (n % 2 && n != 1)
	    continue;
	dfs(0, 1);
    }
    return 0;
}