1002. Anti-prime Sequences

最新推荐文章于 2018-08-10 20:18:53 发布

Sptzxb

最新推荐文章于 2018-08-10 20:18:53 发布

阅读量326

点赞数 1

分类专栏： soj

本文链接：https://blog.csdn.net/u012928014/article/details/41545623

版权

soj 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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.

dfs和回溯我的回溯一直WA 最后无奈参考了一位师兄的回溯豁然开朗！

#include <iostream>
#include <cstring>
using namespace std;

int n,m,d,arr[1002],vis[1002]; //arr储存答案，vis记录是否访问过某位置
bool b;//判断答案是否存在

bool prime(int x)
{
  for(int i=2;i*i<=x;++i)
    if(x%i==0)
      return false;
  return true;
}

bool check(int pos,int s)//判断s是否可以放在arr[pos]上
{
  for(int i=pos-1;i>=0&&i>=pos-d+1;--i)
    {
      s+=arr[i];
      if(prime(s))
	return false;
    }
  return true;
}

void huisu(int pos)
{
  for(int i=n;i<=m;++i)
    {
      if(vis[i]==0&&check(pos,i))
	{
	  vis[i]=1;
	  arr[pos]=i;
	  if(pos==m-n)
	    {
	      b=1;
	      return ;
	    }
	  huisu(pos+1);
	  if(b==1)
	    return;//最后一次调用结束，逐级返回
	  vis[i]=0;
	}
    }
}

int main()
{
  while(cin>>n>>m>>d&&n)
    {
      b=0;
      memset(vis,0,sizeof(vis));
      huisu(0);
      if(b)
	{
	  cout<<arr[0];
	  for(int i=1;i<=m-n;i++)
	    cout<<","<<arr[i];
	  cout<<endl;
	}
      else
	cout<<"No anti-prime sequence exists."<<endl;
    }
  return 0;
}