PPK(outdated)
if (massiv[i] == (massiv[i-1])) {
count++;
} else { count = 1;}обновляем, если цифра поменялась
if (result <= count) {
result = count;
number = massiv[i];
3. Find the biggest and the smallest element of array
int numbers[] = {};
int smallest = numbers[0];
int largetst = numbers[0];
for(int i=1; i< numbers.length; i++){
if(numbers[i] > largetst)
largetst = numbers[i];
else if (numbers[i] < smallest)
smallest = numbers[i]; }
4. Find the biggest sum in matrix
int[][] matrix = new int[3][3];
Random rand = new Random();
for(int i = 0; i < matrix.length; i++) {
annaabi.ee 
