专题二 第十一道题

1.题目编号：1020

2.简单题意：输入一个正整数n，把整数1，2，3，4……,n组成一个环，使得相邻的两个整数之和均为素数。输出时从证书1开始逆时针排列。同一个环应恰好输出一次。n<=16.

3.解题思路形成过程：这道题在算法经典入门里有，他上面写的是用到了回溯法，其实就是按照深度优先的顺序遍历。需要注意的是不要忘记测试第一个数和最后一个数

4.感悟：一直wa，感觉写的挺对的啦……原来是输出的格式不对，原本以为是Case：n，其实是Case n：，还有，每个Case后面两个回车之后再输出别的Case，结果没看到，一直wa。神啊~能不能救救我这双无法看准题目的大眼睛

5.AC的代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int n,a[100],vis[100],prime[100];
bool isPrime(int x){
    for (int i=2;i<=sqrt(x+0.0);i++){
        if (x%i==0)
        return false;
    }
    return true;
}
void dfs(int x){
    if (x==n&&prime[a[1]+a[n]]){
        for (int i=1;i<n;i++){
            cout<<a[i]<<" ";
        }
        cout<<a[n];
        cout<<endl;
         return  ;
    }
    else {
        for(int i=2;i<=n;i++){
            if (!vis[i]&&prime[a[x]+i]){
                a[x+1]=i;
                vis[i]=1;
                dfs(x+1);
                vis[i]=0;
            }
        }
    }
}
int main(){
    int t = 0;
 while(cin>>n){
     for(int i=2;i<=n*2;i++)
     prime[i]=isPrime(i);
 {   t++;
  cout<<"Case "<<t<<":"<<endl;;
  memset(vis,0,sizeof(vis));
  a[1] = 1;
  vis[1] = 1;
  dfs(1);
 }
 cout<<endl;
}
 return 0;
}

原题：

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.<br><br>Note: the number of first circle should always be 1.<br><br><img src=../../data/images/1016-1.gif><br>

 

Input

n (0 < n < 20).<br>

 

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.<br><br>You are to write a program that completes above process.<br><br>Print a blank line after each case.<br>

 

Sample Input

  
  

   
   6<br>8<br>
  
  

 

Sample Output

  
  

   
   Case 1:<br>1 4 3 2 5 6<br>1 6 5 2 3 4<br><br>Case 2:<br>1 2 3 8 5 6 7 4<br>1 2 5 8 3 4 7 6<br>1 4 7 6 5 8 3 2<br>1 6 7 4 3 8 5 2<br>