HDU 1016 Prime Ring Problem - 隐式图的搜索

《BestCoder用户手册》下载

Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26774    Accepted Submission(s): 11943 Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note: the number of first circle should always be 1.   Input n (0 < n < 20).   Output The output format is shown as sample below. Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. Print solutions in lexicographical order. You are to write a program that completes above process. Print a blank line after each case.   Sample Input 6 8   Sample Output Case 1: 1 4 3 2 5 6 1 6 5 2 3 4 Case 2: 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 此题是利用dfs 的回溯现象排序，隐式图的搜索 #include #include #include int n; int vis[100]; int f[100]; int prime(int x) { if(x==1) return 0; if(x==2) return 1; for(int i=2;i<=(int)sqrt(double(x));i++) { if(x%i==0) return 0; } return 1; } void dfs(int x) { if(x==n&&prime(f[n-1]+f[0])){ for(int j=0;j