Uva 524 Prime Ring Problem

import java.util.Scanner;

public class Main{

	static boolean[] isp;
	static int[] a;
	static boolean[] vis;
	static int kcase = 0;
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int t = 0;
		while (scanner.hasNext()) {
			if (t++ > 0) System.out.println();
			int n = scanner.nextInt();
			a = new int[n];
			a[0] = 1;
			isp = new boolean[n*2 + 1];
			vis = new boolean[n + 1];
			for (int i = 0; i <= n; i++) vis[i] = false;
			for (int i = 2; i <= n*2; i++) {
				isp[i] = isPrime(i);
			}
			System.out.println("Case " + (++kcase) + ":");
			dfs(1, n);
		}
	}
	
	public static void dfs(int cur, int n) {
		if (cur == n && isp[a[0] + a[n-1]]) {
			for (int i = 0; i < n - 1; i++) System.out.print(a[i] + " ");
			System.out.print(a[n -1]);
			System.out.println();
			
		} else {
			for (int i = 2; i <= n; i++) {
				if (!vis[i] && isp[i + a[cur - 1]]) {
					a[cur] = i;
					vis[i] = true;
					dfs(cur+1, n);
					vis[i] = false;
				}
			}
		}
	}
	
	public static boolean isPrime(int key) {
		boolean flag = true;
		if (key < 2) return false;
		else {
			for (int i = 2; i <= Math.sqrt(key); i++) {
				if ( key % i == 0) {
					flag = false;
					break;
				}
			}
		}
		return flag;
	}
}