UVA 524(dfs)

题目描述

思路

深搜，并提前处理将1放进数组就好了。
注意格式要求

具体代码

#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <unordered_map>
#include <map>
#include <set>

using namespace std;

#define _for(i, a, b) for (int i = (a); i < (b); i ++ )
#define _rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define mcpy(b, a) memcpy(b, a, sizeof a)
#define mset(a) memset(a, -1, sizeof a)
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define mp make_pair

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

const int N = 20;

int n;
int path[N];
bool st[N];

bool check(int x) {
	_for (i, 2, x)
		if (x % i == 0) return false;
	
	return true;
}

void dfs(int u) {
	if (u == n && check(path[0] + path[u - 1])) {
		_for (i, 0, n) printf("%d%s", path[i], i < n - 1? " ": "\n");
		return;
	}
	
	_rep (i, 2, n) {
		int t = path[u - 1] + i;
		if (check(t) && !st[i]) {
			path[u] = i;
			st[i] = true;
			dfs(u + 1);
			st[i] = false;
		}
	}
}

int main() {
	int t = 0;
	
	path[0] = 1;
	st[1] = true;
	
	while(scanf("%d", &n) == 1) {
        if(t) puts("");
        cout << "Case " << ++t << ":\n";
        dfs(1);
    }
	
	return 0;
}