巧排数字
问题:将连续整数1、2、……n(n<=12)按一定顺序排成一排,让相邻2个数之和和首尾两个数之和均为素数,输出所有排法。
用递归肯定可以解决问题。
def prime(n): # 判断是否素数
if n == 2:
return True
if n == 1 or n % 2 == 0:
return False
for _i in range(3, int(n ** 0.5) + 1, 2):
if n % _i == 0:
return False
return True
def dfs(m, k): # 递归
if k == N: # 判断输出条件是否具备
if prime(m + result[0]):
result.append(m)
temp = copy.deepcopy(result) # 这个深度复制不能少
result.pop()
if temp not in sun: # 去重
sun.append(temp)
print(temp)
return
for _i in range(1, N + 1):
if _i not in result and abs(_i - m) % 2 and prime(_i + m) == 1: # _i之前未曾使用,且与m奇偶间隔,_i+m为素数
result.append(m)
dfs(_i, k + 1) # m、_i相邻
result.pop()
if __name__ == "__main__":
import copy
result, sun = [], []
N = int(input("请输入一个不大于12的正整数:\n"))
for i in range(1, N + 1):
for j in range(1, N + 1):
if j not in result and abs(i - j) % 2 == 1 and prime(i + j):
dfs(j, 1) # i、j相邻
运行结果:
D:\Python\Python38\python.exe D:/Python/study/20210116.py
请输入一个不大于12的正整数:
8
[2, 1, 4, 7, 6, 5, 8, 3]
[2, 1, 6, 7, 4, 3, 8, 5]
[2, 3, 8, 5, 6, 7, 4, 1]
[2, 5, 8, 3, 4, 7, 6, 1]
[4, 1, 2, 3, 8, 5, 6, 7]
[4, 3, 8, 5, 2, 1, 6, 7]
[4, 7, 6, 1, 2, 5, 8, 3]
[4, 7, 6, 5, 8, 3, 2, 1]
[6, 1, 2, 5, 8, 3, 4, 7]
[6, 5, 8, 3, 2, 1, 4, 7]
[6, 7, 4, 1, 2, 3, 8, 5]
[6, 7, 4, 3, 8, 5, 2, 1]
[1, 2, 3, 8, 5, 6, 7, 4]
[1, 2, 5, 8, 3, 4, 7, 6]
[1, 4, 7, 6, 5, 8, 3, 2]
[1, 6, 7, 4, 3, 8, 5, 2]
[3, 2, 1, 4, 7, 6, 5, 8]
[3, 4, 7, 6, 1, 2, 5, 8]
[3, 8, 5, 2, 1, 6, 7, 4]
[3, 8, 5, 6, 7, 4, 1, 2]
[5, 2, 1, 6, 7, 4, 3, 8]
[5, 6, 7, 4, 1, 2, 3, 8]
[5, 8, 3, 2, 1, 4, 7, 6]
[5, 8, 3, 4, 7, 6, 1, 2]
[8, 3, 2, 1, 4, 7, 6, 5]
[8, 3, 4, 7, 6, 1, 2, 5]
[8, 5, 2, 1, 6, 7, 4, 3]
[8, 5, 6, 7, 4, 1, 2, 3]
[7, 4, 1, 2, 3, 8, 5, 6]
[7, 4, 3, 8, 5, 2, 1, 6]
[7, 6, 1, 2, 5, 8, 3, 4]
[7, 6, 5, 8, 3, 2, 1, 4]
Process finished with exit code 0
改进一下:
def prime(n): # 判断是否素数
if n == 2:
return True
if n == 1 or n % 2 == 0:
return False
for _i in range(3, int(n ** 0.5) + 1, 2):
if n % _i == 0:
return False
return True
def dfs(m, k): # 递归
if k == N: # 判断输出条件是否具备
if prime(m + result[0]):
result.append(m)
print(result)
result.pop()
return
for _i in range(1, N + 1):
if _i not in result and prime(_i + m): # _i之前未曾使用,_i+m为素数
result.append(m)
dfs(_i, k + 1) # m、_i相邻
result.pop()
if __name__ == "__main__":
result = []
N = int(input("请输入一个不大于12的正整数:\n"))
for i in range(1, N + 1):
dfs(i, 1)
用C++再写一次:
#include <iostream>
#include<deque>
using namespace std;
deque<int>result;
int n;
int cc = 0;
bool prime(int _j) {
if (_j == 2)return true;
if (_j % 2==0 || _j==1)return false;
for (int i = 3; i<=int(sqrt(_j))+1;i+=2)
if (_j%i==0) return false;
return true;
}
bool adjacent(int x) {
for (auto y : result)
if (y == x)return false;
return true;
}
void dfs(int m, int k) {
if (k == n) {
if (prime(m + result.front())) {
cc++;
result.push_back(m);
for (int r = 0; r < n; r++)cout << result.at(r) << " ";
cout << endl;
result.pop_back();
}
return;
}
for (int j = 1; j<=n; j++)
if(adjacent(j) && prime(m+j)){
result.push_back(m);
dfs(j, k + 1);
result.pop_back();
}
}
int main() {
cin >> n;
for (int i = 1; i <=n; i++) dfs(i, 1);
cout << cc << endl;
}
对比了一下结果,应该没有问题,但感到意外的是,运行速度比较慢,比python还慢,不知道出了什么问题,这是第二次遇到相同问题用相同思路解题,C++比python慢的情况,希望得到大神的指导。