UVA - 524 Prime Ring Problem

//这两天做题各种小错误，落空行了。。

#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 16 + 5;
int C[maxn];
int used[maxn];
int n;
int kase =0;
int is_prime(int n)
{
    for(int i = 2; i < n; ++i)
    {
        if(n%i == 0) return 0;
    }
    return 1;
}
void solve(int cur)
{
    if(cur == n && is_prime(C[0] + C[n-1]))
    {
       for(int i = 0; i < n; ++i)
       {
           if(!i) printf("%d", C[i]);
           else printf(" %d", C[i]);
       }
       printf("\n");
    }
    for(int j = 2; j <= n; ++j)
    {
        int ok = false;
        if(!used[j] && is_prime(C[cur-1]+j))
        {
            C[cur] = j;
            used[j] = 1;
            solve(cur+1);
            used[j] = 0;
        }
    }
}
int main()
{
    while(scanf("%d", &n)!= EOF)
    {
        if(kase > 0) printf("\n");
        memset(C,0,sizeof(C));
        memset(used, 0, sizeof(used));
        ++kase;
        printf("Case %d:\n", kase);
        C[0] = 1;
        used[1] = 1;
        solve(1);
    }
    return 0;
}