Anti-prime Sequences
Time Limit: 3000MS | Memory Limit: 30000K | |
Total Submissions: 2777 | Accepted: 1284 |
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.
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.
No anti-prime sequence exists.
Sample Input
1 10 2 1 10 3 1 10 5 40 60 7 0 0 0
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
题目大意:输入m, n, d,求出m,m+1,m+2,““m+n的一个排列。使得任意的连续k个数之和都为合数,2<=k<=d。
思路:暴力DFS,依次枚举第一个数,第二个数····,第n-m+1个数即可.但是不清楚为什么DFS会超时……
#include<iostream> #include<cstdio> using namespace std; const int LEN=1005; bool isprime[LEN]; int arr[LEN]; int n, m, d; bool used[LEN]; void getprime() { for(int i=2; i<=50; i++) { if( !isprime[i] ) for(int j=i; i*j<LEN; j++) isprime[i*j]=1; } } bool judge(int& index, int& value) { if( index==0 ) return true; int st=index-d+1; if( st<0 ) st=0; int sum=value; for(int i=index-1; i>=st; i--) { sum+=arr[i]; if( !isprime[sum] ) return false; } return true; } bool dfs(int index) { if( index==m-n+1 ) return true; for(int i=n; i<=m; i++) { if( !used[i] && judge(index, i) ) { arr[index]=i; used[i]=true; if( dfs(++index) ) return true; used[i]=false; } } return false; } int main() { int i, j; getprime(); while( scanf("%d%d%d", &n, &m, &d)!=EOF ) { if( n+m+d==0 ) break; memset(used, 0, sizeof(used)); if( dfs(0) ) { for(i=0; i<m-n; i++) printf("%d,", arr[i]); printf("%d\n", arr[i]); } else printf("No anti-prime sequence exists.\n"); } return 0; }