p1016 深搜

package cn.hncu.search;import java.util.Scanner;public class Seach3 {public static boolean isPrime(int n){if(n==2)return true;for(int i=2;i*i<=n;i++){if(n%i==0){return false;}}return true;}public static void main(String[] args) {Scanner sc = new Scanner(System.in);while(sc.hasNext()){int n = sc.nextInt();//初始化图Node nodes[] = new Node[n];for(int i=0;i<nodes.length;i++){nodes[i] = new Node(i+1,-1,null);}int startNum=0;int count=0;//计数dfs(nodes,startNum,count);}}private static void dfs(Node[] nodes, int u, int count) {count++;nodes[u].color=1;//鸿沟if(count==nodes.length && isPrime(nodes[u].value+nodes[0].value) ){print(nodes,u);}for(int v=1;v<nodes.length;v++){if(nodes[v].color==-1 && isPrime(nodes[u].value+nodes[v].value)){nodes[v].parent = nodes[u];dfs(nodes,v,count);nodes[v].color=-1;nodes[v].parent=null;}}}private static void print(Node[] nodes, int u) {//倒输出所有的值Node nodes2[] = new Node[nodes.length];Node node = nodes[u];for(int i=nodes.length-1; i>=0; i--){nodes2[i] = node;node = node.parent;}int i=0;for(;i<nodes.length-1;i++){System.out.print(nodes2[i].value+" ");}System.out.println(nodes2[i].value);}}class Node{int value;int color;Node parent;public Node(int value, int color, Node parent) {this.value = value;this.color = color;this.parent = parent;}}