hdoj1016Prime Ring Problem

经典搜索，打表应该比函数快，因为最大才20

#include <stdio.h>

#include <string.h>
int sushu[] = {0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 
1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 
0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0};


void dfs(int dpth);
int n;
int num[25],a[25];
int main(int argc, char *argv[])
{
int j=1;
while(scanf("%d",&n)!=EOF)
{ 
printf("Case %d:\n",j++);
memset(num,0,sizeof(num));
memset(a,0,sizeof(a));
a[1]=1;num[1]=1;
dfs(1);
printf("\n");
}
return 0;
}
void dfs(int dpth)
{
int i,j;
if(dpth==n)
{
if(sushu[1+a[dpth]]==1)
{
for(j=1;j<n;j++)
                printf("%d ",a[j]);
            printf("%d\n",a[n]);
}
else return ;
}
else
{
for(i=2;i<=n;i++)
{
if(num[i]==0&&sushu[i+a[dpth]]==1)
{
a[dpth+1]=i;
num[i]=1;
dfs(dpth+1);
num[i]=0;
}
}
}

}