Prime Ring Problem(dfs)

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int a[20],vis[20];
int n,k = 0;
bool judge(int num){
	for(int i = 2;i <= sqrt(num);i ++){
		if(num % i == 0) return false;
	}
	return true;
}
void print(){
	for(int i = 1;i <= n;i ++){
		cout<<a[i];
		if(i == n) cout<<endl;
		else cout<<" ";
	}
}
void dfs(int idx){
	if(idx == n + 1){
		if(judge(a[1] + a[n])) print();
		return;
	}
	for(int i = 2;i <= n;i ++){
		if(!vis[i] && judge(i + a[idx-1])){
			vis[i] = 1;
			a[idx] = i;
			dfs(idx+1);
			vis[i] = 0;
		}
	}
}
int main(){
	while(cin>>n){
		if(k ++) cout<<endl;
		cout<<"Case "<<k<<":"<<endl;
		a[1] = 1;
		dfs(2);
	}
}