Matrix search problem

#1

what is wrong in my code

#2

Hi @Adhyayan,
I cannot access your code … Can you please share it

#3

import java.util.*;
import java.util.Scanner;
public class Main {
static Scanner sc=new Scanner(System.in);
public static void main(String args[]) {
int[][] p=getarray();
int[] n=transform§;
int item=sc.nextInt();
int s=binarysearch(n,item);
System.out.println(s);

}
public static int[][] getarray(){
	int rows=sc.nextInt();
	int columns=sc.nextInt();
	int[][] arr=new int[rows][columns];
	if(rows>=1&&columns<=30){
		
	    for(int row=0;row<rows;row++){
			for(int col=0;col<columns;col++){
				if(arr[row][col]>=0&&arr[row][col]<=100){
					arr[row][col]=sc.nextInt();
				}
			}
		}
		

	}
	return arr;
	



	
}


public static int[] transform(int[][] p){
	int[] ars=new int[p.length*p.length];
	int k=0;

	for(int i=0;i<p.length;i++){
		for(int j=0;j<p[i].length;j++){
			ars[k++]=p[i][j];
		}
	}
	return ars;
}
public static int binarysearch(int[] ars,int item){
	int low=0;
	int high=ars.length-1;
	while(low<=high){
		int mid =(low + high)/2;
		if(ars[mid]==item){
			return 1;
		}
		else if(ars[mid]>item){
			high=mid-1;
		}
		else{
			low=mid+1;
		}
	}
	return 0;
}

}

#4

@Adhyayan please share your code by saving it on ide.codingblocks.com
int[] n=transform§; what is this $ symbol?