2034 Anti-prime Sequences 素数环变形好水的dfs 不过题目数据让人无语，我开了10K的数组才让过-CSDN博客

本文链接：https://blog.csdn.net/kongming_acm/article/details/5860071

Anti-prime Sequences

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 1410		Accepted: 657

Description

Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers sums to a composite (non-prime) number. For example, if n = 1 and m = 10, one such anti-prime sequence is 1,3,5,4,2,6,9,7,8,10. This is also the lexicographically first such sequence.

We can extend the definition by defining a degree danti-prime sequence as one where all consecutive subsequences of length 2,3,...,d sum to a composite number. The sequence above is a degree 2 anti-prime sequence, but not a degree 3, since the subsequence 5, 4, 2 sums to 11. The lexicographically .rst degree 3 anti-prime sequence for these numbers is 1,3,5,4,6,2,10,8,7,9.

Input

Input will consist of multiple input sets. Each set will consist of three integers, n, m, and d on a single line. The values of n, m and d will satisfy 1 <= n < m <= 1000, and 2 <= d <= 10. The line 0 0 0 will indicate end of input and should not be processed.

Output

For each input set, output a single line consisting of a comma-separated list of integers forming a degree danti-prime sequence (do not insert any spaces and do not split the output over multiple lines). In the case where more than one anti-prime sequence exists, print the lexicographically first one (i.e., output the one with the lowest first value; in case of a tie, the lowest second value, etc.). In the case where no anti-prime sequence exists, output

No anti-prime sequence exists.

Sample Input

Sample Output

1,3,5,4,2,6,9,7,8,10
1,3,5,4,6,2,10,8,7,9
No anti-prime sequence exists.
40,41,43,42,44,46,45,47,48,50,55,53,52,60,56,49,51,59,58,57,54

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int prime[10100],is[10100],pl;
void _prime()
{
    is[1]=1;
    for(int i=2;i<10100;i++)
    {
        if(is[i]==0) prime[pl++]=i;
        for(int j=0;j<pl&&i*prime[j]<10100;j++)
        {
            is[i*prime[j]]=1;
            if(i%prime[j]==0) break;
        }
    }
}
int n,m,d;
int flag;
int vis[10100],ans[10100];
int check(int v,int id)
{
    int cnt=v;
    for(int i=id-1;i>=n&&i>=id-d+1;i--)
    {
        cnt+=ans[i];
        if(is[cnt]==0) return 0;
    }
    return 1;
}
void out()
{
    for(int i=n;i<m;i++) printf("%d,",ans[i]); printf("%d/n",ans[m]);
}
void dfs(int id)
{
    if(flag) return ;
    for(int i=n;i<=m;i++)
    {
        if(vis[i]==0)
        {
            vis[i]=1;
            if(check(i,id))
            {
                ans[id]=i;
                if(id==m)
                {
                    out();
                    flag=1;
                    return ;
                }
                dfs(id+1);
            }
            vis[i]=0;
        }
    }
}
int main()
{
    _prime();
    while(scanf("%d%d%d",&n,&m,&d)==3&&n)
    {
        flag=0;
        memset(vis,0,sizeof(vis));
        dfs(n);
        if(!flag) printf("No anti-prime sequence exists./n");
    }
    return 0;
}