POJ - 2034 Anti-prime Sequences（素数判断+搜索）

题意：给你n和m（n,m <= 1000），求n到m的一个排列A，使得A中长度为l（ 2<= l <= k ,k  >= 2）的子串的和为合数（非素数）。

思路：很明显的搜素+剪枝。当枚举到cur位置时，判断一下长度为l子串的和是否为合数，如果不是就剪掉。

#include <cstdio>
#include <algorithm>
#include <iostream>
#include<vector>
#include<cmath>
#include<set>
#include<cstring>
#include<sstream>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 40000 + 10;
const int maxt = 100200;
const int inf = 0x3f3f3f3f;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int mod = 1e9 + 7;
const double pi = acos(-1.0);
const double eps = 1e-8;
int n, m, k;
int ans[1010];
int vis[1010];
int p[10010];
int flag;
void dfs(int cur){
    if(flag) return;
    if(cur == m - n + 1){
        for(int i = 0; i < cur; ++i){
            if(i) printf(",");
            printf("%d", ans[i]);
        }
        printf("\n");
        flag = 1;
        return;
    }
    for(int i = n; i <= m; ++i){
        if(vis[i]) continue;
        int ok = 1;
        int sum = i;
        for(int j = cur - 1; j >= 0 && j > cur - k; --j)
            if(!p[sum += ans[j]]) {ok = 0; break;}
        if(!ok) continue;
      //  printf("%d %d\n", cur, i);
        ans[cur] = i;
        vis[i] = 1;
        dfs(cur + 1);
        vis[i] = 0;

    }
}
int main(){
    for(int i = 2; i <= 10000; ++i){
        if(!p[i]){
            for(int j = i + i; j <= 10000; j += i)
                p[j] = 1;
        }
    }
    while(scanf("%d%d%d", &n, &m, &k) && n + m + k){
        flag = 0;
        memset(vis, 0, sizeof vis);
        dfs(0);
        if(!flag) printf("No anti-prime sequence exists.\n");
    }
}