11-Lekciya

Scanner in = new Scanner(System.in); int n, m;

System.out.print("n="); n = in.nextInt();

System.out.print("m="); m = in.nextInt(); int[][] arr = new int[n][m];

for (int i = 0; i < n; i++)

for (int j = 0; j < m; j++) arr[i][j] = in.nextInt();

for (int i = 0; i < n; i++) { int max = arr[i][0];

for (int j = 0; j < m; j++){

if(max < arr[i][j]) max = arr[i][j]; System.out.print(arr[i][j]+" ");

}

System.out.println("max=" + max);

}

run:

n=3

m=4

5 7 1 0

8 2 9 7

7 5 2 2

5 7 1 0 max=7

8 2 9 7 max=9

7 5 2 2 max=7

Scanner in = new Scanner(System.in); int n;

double bas=0, keri=0;

System.out.print("n="); n = in.nextInt();

double[][] arr = new double[n][n]; for (int i = 0; i < n; i++)

for (int j = 0; j < n; j++) arr[i][j] = in.nextInt();

for (int i = 0; i < n; i++){ bas += arr[i][i];

keri += arr[i][n-i-1];

}

System.out.println("bas dioganal:"+bas);

System.out.println("keri dioganal:"+keri);

run:

n=3 4 6 3 7 8 2 8 4 2

bas dioganal:14.0 keri dioganal:19.0

Scanner in = new Scanner(System.in); int n, indexJ = 0;

System.out.print("n="); n = in.nextInt(); double[][] arr = new double[n][n];

for (int i = 0; i < n; i++)

for (int j = 0; j < n; j++) arr[i][j] = in.nextDouble();

for (int i = 0; i < n; i++) { indexJ = 0;

for (int j = 1; j < n; j++) if(arr[i][indexJ]>arr[i][j])

indexJ = j; boolean erNoqat = true; for (int k = 0; k < n; k++)

if(arr[i][indexJ]<arr[k][indexJ]) erNoqat = false;

if(erNoqat) System.out.println("arr["+i+"][" +indexJ+"]="+arr[i][indexJ]);}

run:

n=3

3 5 1

8 7 9

2 6 4

arr[1][1]=7.0