import java.util.Random;
import java.util.*;


public class Matrix {

    public static void main(String[] args) {

    	int[][] arr = createMatrix(3,3);
    	showMatrix(arr);
    	System.out.println(sumMatrix(arr));
    	System.out.println(calcAverage(arr));
    	//orderMatrix(arr);
    	System.out.println(sumColumns(arr));
    	transposeMatrix(arr);

    }

    //1
    public static void showStudentData() {
   		String name = "Karol Maczuga";
   		String nrAlbumu = "2137";
   		System.out.println(name.toUpperCase() + ", numer albumu: " + nrAlbumu);
    }
    //2
    public static int[][] createMatrix(int x, int y) {
    	Random r = new Random();
    	int[][] arr = new int[x][y];
    	for (int i = 0; i<arr.length;i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			arr[i][j] = r.nextInt(9)+1;
    		}
    	} return arr;
    }
    //3
    public static void showMatrix(int[][] arr) {
    	for (int i = 0; i<arr.length;i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			System.out.print(arr[i][j] + " ");
    		} System.out.println();
    	}
    }
    //4
    public static int sumMatrix(int[][] arr) {
    	int sum = 0;
    	for (int i = 0; i<arr.length;i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			sum += arr[i][j];
    		}
    	} return sum;
    }
    //5
    public static int calcAverage(int[][] arr) {
    	int size = 0;
    	int sum = 0;
    	int avg = 0;
    	for (int i = 0; i<arr.length;i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			sum += arr[i][j];
    		} size = arr.length*arr[i].length;
    	} avg = (sum/size);
    	return avg;
    }
    //6 nie dziala
    public static int[][] orderMatrix(int[][] arr) {
    	Random rand = new Random();
    	int matrixSize = arr.length*arr[0].length;
    	int[] tab = new int[matrixSize];
    	for (int k = 0; k<tab.length; k++) {
    		tab[k] = rand.nextInt(9)+1;
    	} Arrays.sort(tab);
    	for (int d : tab)
    		System.out.print(d + " ");
    		System.out.println();
    	for (int i = 0; i<arr.length;i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    				int k = 0;
    				if (k < arr.length) {
    					arr[0][i] = tab[k];
    					k++;
    				} else if (k >= arr.length && k < matrixSize - arr.length) {
    						i = 0;
    						k = arr.length;
    						arr[1][i] = tab[k];
    						k++;
    				  } else {
    				  		i = 0;
    				  		k = matrixSize - arr.length;
    				  		arr[2][i] = tab[k];
    				  		k++;
    				  	}
    		}

    	} return arr;
    }
    //7
    public static int[] sumColumns(int[][] arr) {
    	int sum;
    	int[] tab = new int[arr[0].length];
		for (int j = 0; j<arr[0].length; j++) {
			sum = 0;
			for (int i = 0; i<arr.length; i++) {
				sum += arr[i][j];
				tab[i] = sum;
			}
		} return tab;
    }

    //8
    public static int[][] transposeMatrix(int[][] arr) {
    	int[][] tab = new int[arr[0].length][arr.length];
    	for (int i = 0; i<arr.length; i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			tab[j][i] = arr[i][j];
    		}
    	}
    		for (int g = 0; g<tab.length; g++) {
    			for (int h = 0; h<tab[0].length; h++) {
    		 		System.out.print(tab[g][h] + " ");
    		 	} System.out.println();
    		} return tab;
    }
    //9
    public static int[] searchEven(int[][] arr) {
    	int counter = 0;
    	for (int i = 0; i<arr.length; i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			if (arr[i][j] % 2 == 0)
    				counter++;
    		}
    	}
    	int[] tab = new int[counter];
    	counter = 0;
    	for (int i = 0; i<arr.length; i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			if (arr[i][j] % 2 == 0)
    				tab[counter] = arr[i][j];
    				counter++;
    		}
    	} return tab;
    }
    //10
    public static int[] searchEngine(int[][] arr, int x, int y) {
    	int counter = 0;
    	for (int i = 0; i<arr.length; i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			if (arr[i][j] >= x && arr[i][j] <= y)
    				counter++;
    		}
    	}
    	int[] tab = new int[counter];
    	counter = 0;
    	for (int i = 0; i<arr.length; i++) {
    		for (int j = 0; j<arr[i].length; j++) {
    			if (arr[i][j] >= x && arr[i][j] <= y)
    				tab[counter] = arr[i][j];
    				counter++;
    		}
    	} return tab;
    }




















































}