素数环（暴力深搜）

#include <bits/stdc++.h>
using namespace std;

int a[30]={0};
int vis[22]={0};
int counts = 0;

int prim(int n)
{
	for(int i = 2 ; i < n; i++)
	{
		if(n % i == 0)
		 return 0;
	}
	return 1;
}
int cnt; 
void dfs(int n)
{
	if(n == cnt)
	 {
	 	if(prim(a[cnt]+a[1]) == 1)
	 	{
//	 		for(int i = 1; i <= 19; i++)
//		 		cout<<a[i]<<" ";
//			 cout<<a[20]<<endl;
			 counts++;
	    	
		}
	 }
	else
	{
		for(int i = 1; i <= cnt ; i++)
		{
			if((vis[i] == 0) && (prim(a[n]+i) == 1))
			{
				//cout<<n<<endl;
				n++;        a[n] = i;    vis[i] = 1;
				dfs(n);
				vis[i] = 0;     n--;
			}
		}
	}
}
int main()
{
    memset(a,0,sizeof(a));
    memset(vis,0,sizeof(vis));
    cin>>cnt;
	dfs(0);
	cout<<counts<<endl;
	return 0;
}