please write it in C language. import java.util.*; public class EightQDfs { final int X = 4; void dispSol(int brd[][]) { for(int i = 0; i < X ; i++) { for(int j=0 ; j < X ; j++) { System.out.print(" " + brd[i][j]) + " "); System.out.println(); } } boolean isSafe(int brd[][] , int r , int c) //r is for row and c is column { int i , j; for(i = 0 ; i < c ; i++) if(brd[r][i] == 1) return false; for(i = r ; j = c ; i >=0 && j >= 0 ;i-- ,j--) if(brd[i][j] == 1) return false; for(i = r , j = c ; j >= 0 && i < X ; i++ , j--) if(brd[i][j] == 1) return false; return true; } boolean EQsolved(int brd[][] , int c) { if(c >= X) return true; for(int i= 0; i < X ;i++) { if(isSafe(brd , i , c)) { brd[i][c] = 1; if(EQsolved(brd , c + 1) == true ) return true; brd[i][c] = 0 ; } }
please write it in C language.
import java.util.*;
public class EightQDfs
{
final int X = 4;
void dispSol(int brd[][])
{
for(int i = 0; i < X ; i++)
{
for(int j=0 ; j < X ; j++)
{
System.out.print(" " + brd[i][j]) + " ");
System.out.println();
}
}
boolean isSafe(int brd[][] , int r , int c) //r is for row and c is column
{
int i , j;
for(i = 0 ; i < c ; i++)
if(brd[r][i] == 1)
return false;
for(i = r ; j = c ; i >=0 && j >= 0 ;i-- ,j--)
if(brd[i][j] == 1)
return false;
for(i = r , j = c ; j >= 0 && i < X ; i++ , j--)
if(brd[i][j] == 1)
return false;
return true;
}
boolean EQsolved(int brd[][] , int c)
{
if(c >= X)
return true;
for(int i= 0; i < X ;i++)
{
if(isSafe(brd , i , c))
{
brd[i][c] = 1;
if(EQsolved(brd , c + 1) == true )
return true;
brd[i][c] = 0 ;
}
}
return false;
}
boolean EQsol()
{
int brd[][] = { { 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} ,
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} ,
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} ,
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} ,
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} ,
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} ,
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0},
{ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0} };
if(EQsolved(brd , 0) ==false)
{
return false;
}
dispSol(brd);
return true;
}
public static void main(String[] args)
{
EightQDfs Equeen = new EightQDfs();
Equeen.EQsol();
}
}
Step by step
Solved in 4 steps with 4 images
