摘要：
1 #include<stdio.h> 2 #include<string.h> 3 4 int prime[38]={0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1}; 5 int visit[21],result[21]; 6 int n; 7 8 int dfs(int num) 9 {10 int print(int m);11 int i;12 if(num==n && prime[result[num]+result[1]])13 p... 阅读全文
