Funky Chess Board Java

justformyntra8 · June 6, 2019, 8:54pm

i am unable to get the answer-
kindly let me know where I am mistaken

bhardwaj-aman/java-data-structures-practice-questions/blob/master/(*) Funky Chess Board

package RECURSIONPRACTICE;
import java.util.*;
public class funkyChessBoard {
    public static void main(String args[]) {
        Scanner s = new Scanner(System.in);
        int a = s.nextInt();
        int[][] b  = new int[a][a];
        for(int i=0;i<a;i++){
            for(int j=0;j<a;j++){
                b[i][j] = s.nextInt();
            }
        }
        int num1s = 0;

        for(int i=0;i<b[0].length;i++) {
            for (int j = 0; j < b[0].length; j++) {
                if (b[i][j] == 1) {
                    num1s++;

                }

This file has been truncated. show original

Riyabansal98 · June 7, 2019, 2:55pm

Hi Aman

Your code doesn’t work for the case
3
1 0 0
0 0 1
Output should be 0.

justformyntra8 · June 8, 2019, 3:10pm

Hi Riya
According to the question,
we must have 3 lines in the test case, so the test case that you have mentioned might be incorrect…

Riyabansal98 · June 10, 2019, 3:18pm

Hi Aman

There is some problem with the test case. It will resolved asap. Then you can submit your code and it will run for all test cases.

Riyabansal98 · June 22, 2019, 11:19am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.