[求助]皇后问题怎么输出所有可行解（非回溯法）

求助：怎么改写下面这段C=代码，最后输出所有的可行解

// ASSIGNMENT_PROBLEM_2019-02-27.cpp : Defines the entry point for the console application.
// Assignment problem
// Copyright 2019 Matthew E. H. Petering

#include <vector>
#include <cstdlib>//needed for rand()
#include <ctime>//needed for time()
#include <math.h>//needed for ceil()
#include <ilcplex/ilocplex.h>//needed for CPLEX
#include <fstream>
using namespace std;
ILOSTLBEGIN

typedef IloArray<IloNumVarArray> IloNumVarArray2;
typedef IloArray<IloNumVarArray2> IloNumVarArray3;
typedef IloArray<IloIntVarArray> IloIntVarArray2;
typedef IloArray<IloBoolVarArray> IloBoolVarArray2;
//typedef IloArray<IloNumArray> IloNumArray2;
//typedef IloArray<IloNumArray2> IloNumArray3;

const long int ROWS = 8; //12
const long int COLS = 8; //12

int main(int argc, char **argv)
{
	cout << "Note: rows and cols are numbered beginning at zero" << endl;

	unsigned long int startTime = time(NULL);//startTime is system time in sec.
	cout << "Our random number seed = " << startTime << endl;
	srand(startTime);//uses startTime to set the seed for random # generation
	cout<<rand()<<"\n";
	cout<<rand()<<"\n";
	cout<<"RAND_MAX = "<<RAND_MAX<<"\n\n";

	//Indices for columns, diagonals, rows
	long int c,d,r;

	//Creating a cost matrix whose entries are random #'s from 0-99
	double costMatrix[ROWS][COLS];
	for (r=0;r<ROWS;r++)
		for (c=0;c<COLS;c