Scanner reader = new Scanner (System.in);
int n = reader.nextInt();
char[][] array = new char [n][n];
int count=0;
for (int i=0;i<array.length;i++) {
for (int j = 0;j<array.length;j++) {
if (count%2==0) {
array[i][j] = '#';
}
if (count%2==1) {
array[i][j] = ' ';
}
count++;
//write your code here
}
}
for (int i = 0;i<array.length;i++) {![]()
for (int j=0;j<array.length;j++) {
System.out.print(array[i][j]);
}
System.out.println();
//write your code here
}
}
}
for (int j=0;j<array.length;j++) {
System.out.print(array[i][j]);
}
System.out.println();
//write your code here
}
}
}
package en.javarush.task.jdk13.task06.task0634;
import java.util.Scanner;
/*
Chess board
*/
public class Solution {
public static char[][] array;
public static void main(String[] args) {
Scanner reader = new Scanner (System.in);
int n = reader.nextInt();
char[][] array = new char [n][n];
int count=0;
for (int i=0;i<array.length;i++) {
for (int j = 0;j<array.length;j++) {
if (count%2==0) {
array[i][j] = '#';
}
if (count%2==1) {
array[i][j] = ' ';
}
count++;
//write your code here
}
}
for (int i = 0;i<array.length;i++) {
for (int j=0;j<array.length;j++) {
System.out.print(array[i][j]);
}
System.out.println();
//write your code here
}
}
}