Complete the "dumb" 8 queens program. Use the 1 dimensional array representation. please make sure to check that it print the solution

#include

#include

using namespace std;

bool ok(int q[], int c);

void print(int q[]){ }

int main() {

int board[8]={0},

col = 0;

while( /* */){

// if we backtrack beyond the first col, we are done

// if we have moved beyond the last column

if(/* */){

// print the board // backtrack }

// If we have moved beyond the last row

else if(/* */){

// reset queen // backtrack }

// Check if the placed queen is ok.

else if(/* */){

// move to next column if ok } else{

// move to next row if not ok

}

}

return 0;

}