Задача 8. import java.util.Scanner; public class Main5 { public static void main(String[] args) { Scanner input = new Scanner(System.in);

Задача 5

import java.util.Scanner;
public class Main5 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("Vvodim razmernost matrici:");
int m = input.nextInt();
int n = input.nextInt();
int x[][] = new int[m][n];
System.out.println("Vvodim matricu:");
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
x[i][j] = input.nextInt();
int count = 0; // Schetchik chisla osobix elementov
int count1; // kolichestvo neudovletvoryaushix usloviyu sravneniy
for (int i=0; i<m; i++)
for (int j=1; j<n-1; j++)
if (x[i][j]>x[i][j-1] && x[i][j]<x[i][j+1]) // minimalnaya proverka, esli sprava element bolshei sleva menshe perexodim k obshey proverke
{
count1 = 0; // dlya kajdogo elementa obnulyaem danniy schetchik
count++; // incrementiruem schetchik, dalshe v sluchae xotya bi odnogo neudovletvoryauesho usloviya decrementiruem
for (int c = j+2; c < m; c++)
if(x[i][j] >= x[i][c])
count1++;
for (int c = 0; c < j-2; c++)
if(x[i][j] <= x[i][c])
count1++;
if(count1!=0) // esli est' xotya bi odno neudovletvoryaueshee uslovie, to rassmatrivaemiy element ne osobiy, sledovatelno incrementiruem
count--;
}
System.out.println(count);
}
}

Задача 6

import java.util.Scanner;
public class Main6 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("Vvodim razmernost matrici:");
int m = input.nextInt();
int n = input.nextInt();
int x[][] = new int[m][n];
System.out.println("Vvodim matricu:");
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
x[i][j] = input.nextInt();
for (int k = 0; k < m; k++) // delaem obxod m raz (kolichestvo strok, sledovatelno kolichestvo pervix elementov)
for (int j = 0; j < m - 1; j++)
if (x[j + 1][0] < x[j][0]) // delam proverku po usloviyu zadachi
for (int i = 0; i < n; i++) {
int a = x[j + 1][i]; // menyaem mestami stroki, esli ne udovletvoryayut usloviyu
x[j + 1][i] = x[j][i];
x[j][i] = a;
}
for (int i = 0; i < m; i++) {
System.out.println();
for (int j = 0; j < n; j++)
System.out.print(x[i][j] + " ");
}
}
}

Задача 8

import java.util.Scanner;
public class Main8 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("Vvodim razmernost matrici:");
int m = input.nextInt();
int n = input.nextInt();
int x[][] = new int[m][n];
int y[] = new int[m];
System.out.println("Vvodim matricu:");
for (int i = 0; i < m; i++) {
int max = x[i][0];
for (int j = 0; j < n; j++) {
x[i][j] = input.nextInt();
if (x[i][j] > max)
max = x[i][j];
}
y[i] = max;
}
for (int k = 0; k < m - 1; k++) // delaem obxod m raz (kolichestvo strok)
for (int j = 0; j < m - 1; j++)
if (y[j + 1] < y[j]) // delam proverku po usloviyu zadachi
{
int b = y[j+1];
y[j+1] = y[j];
y[j] = b;
for (int i = 0; i < n; i++)
{
int a = x[j + 1][i]; // menyaem mestami stroki, esli ne udovletvoryayut usloviyu
x[j + 1][i] = x[j][i];
x[j][i] = a;
}
}
for (int i = 0; i < m; i++) {
System.out.println();
for (int j = 0; j < n; j++)
System.out.print(x[i][j] + " ");
}
}
}