杭电1016 Prime Ring Problem

Prime Ring Problem

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36557 Accepted Submission(s): 16114

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 <bits/stdc++.h>
#include "iostream"
#include "cstring"
#include "cmath"
using namespace std;

bool is_prime(int n) {

    for(int i = 2; i < n; i++) {
        if(n%i == 0) return false;
    }
    return true;
}

int ring[20];
int k[20];
int N;

void dfs(int x,int num) {
    if(num > N && is_prime(ring[N] + ring[1])) {

        for(int i = 1; i<N; i++){
            cout << ring[i] << " ";
        }
        cout <<ring[N]<< endl;
        return;
    }

    for(int i = 2; i <= N; i++) {
        if(!k[i]) {
            if(is_prime(i+x)) {
                ring[num] = i;
                k[i] = 1;
                dfs(i,num+1);
                k[i] = 0;
            }
        }
    }

}

int main(){

    ios::sync_with_stdio(false);
    int n;
    int kase = 0;
    while(cin >> N) {
        cout <<"Case " << ++kase << ":" << endl;
        memset(k,0,sizeof(k));
        k[1] = 1;
        ring[1] = 1;
        dfs(1,2);
        cout << endl;
    }


    return 0;
}