NYOJ--488--dfs--素数环

/*
    Name: NYOJ--488--素数环
    Author: shen_渊
    Date: 15/04/17 15:30
    Description: DFS,素数打个表，37以内就够用了
*/

#include<cstring>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void dfs(int);
int n;
//int prime[25] = {2,3,5,7,11,13,17,19,23,29,31,37};学到下面一招
]={,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,};
];
];
int main()
{
//    freopen("in.txt","r",stdin);
    ;
    while(cin>>n,n){
        memset(arr,,sizeof(arr));
        memset(vis,,sizeof(vis));
        arr[] = ;
        cout<<"Case "<<++m<<":\n";
        )cout<<"1\n";
        ){
            cout<<"No Answer\n";
        }else{
            dfs();
        }
    }
    ;
}
void dfs(int ct){
     && prime[arr[n]+arr[]]){
            ; i<=n; ++i)
                cout<<arr[i]<<" ";
            cout<<endl;
    }else{
        ; i<=n; ++i){
            ]+i]){
                arr[ct] = i;
                vis[i] = ;
                dfs(ct+);
                vis[i] = ;
            }
        }
    }
}