public class Quee_8{
private static int num=0;
private static int queen[]=new int[4];
public static void main(String args[]){
ff(0);
}
public static void ff(int r){
if(r==4){
num++;
System.out.println(num+"方法");
fff();
return;
}
for(int i=0;i<4;i++){
queen[r]=i;
int k=1;
for(int j=0;j<r;j++)
if(queen[r]==queen[j]||Math.abs((r-j))==Math.abs((queen[r]-queen[j]))){
k=0;
break;
}
if(k==1){
ff(r+1);
}
}
}
public static void fff(){
for(int k=0;k<4;k++){
for(int s=0;s<4;s++){
if(queen[k]==s){
System.out.print(0+" ");
}else{
System.out.print(1+" ");
}
}
System.out.println();
}
}
}