shu_p64 n后问题

//shup64 n queens     
#include      
#include      
#include      
#include      
using namespace std;     
#define M 16     
    
int n;     
int total;     
int x[M];     
    
bool judge(int k)     
{     
    for(int j=1;jn) {     
       total++;     
       if(n<=8){     
          cout<<"Scheme "<