递归和回溯 POJ 2034 Anti-prime Sequences

#include <iostream> using namespace std; #define N 1000 int n, m, d; bool isp[N * 10 + 1]; bool vis[N]; int rcd[N]; bool isPrime(int n) { int a = 2; while(a < n) if (!(n%a++)) break; if(a == n) return 1; return 0; } void init() { for(int i = 2; i <= N * 10; i++) { isp[i] = isPrime(i); } } bool isDComposite(int cur, int num) { if (cur < 1) { return true; } int k = 0; if(cur - d + 1 >= 0) { k = cur - d + 1; } int sum = num; for(int i = cur-1; i >= k; i--) { sum += rcd[i]; if(isp[sum]) { return false; } } return true; } bool dfs(int cur) { if(cur == m-n+1) { return true; } else { for(int i = n; i <= m; i++) { if(!vis[i] && isDComposite(cur, i)) { vis[i] = true; rcd[cur] = i; if(dfs(cur+1)) { return true; } vis[i] = false; } } return false; } } int main() { init(); while(true) { cin >> n >> m >> d; if (n == 0 && m == 0 && d == 0) { return 0; } for(int i = n; i <= m; i++) { vis[i] = false; } if(dfs(0)) { for(int i = 0; i < m-n; i++) { cout << rcd[i] << ","; } cout << rcd[m-n] << endl; } else { cout << "No anti-prime sequence exists." << endl; } } }