System.out.println("\nZAD 8 \n");

            int[] arr1 = new int[15];
            int[] arr2 = new int[15];

            int min = -10;
            int max = 10;

            for (int i = 0; i < arr1.length; i++) {
                arr1[i] = (int) (Math.random() * (max - min + 1) + min);
                System.out.print(arr1[i] + "; ");
            }
            System.out.println();
            for (int i = 0; i < arr2.length; i++) {
                arr2[i] = (int) (Math.random() * (max - min + 1) + min);
                System.out.print(arr2[i] + "; ");
            }


            System.out.println();
            System.out.println("\n#1 \n");
            int[] resultArr1 = new int[arr1.length + arr2.length];
            for (int i = 0; i < arr1.length; i++) {
                resultArr1[i] = arr1[i];
            }

            for (int i = arr1.length, j = 0; i < resultArr1.length; i++, j++) {
                resultArr1[i] = arr2[j];
            }

            for (int i = 0; i <resultArr1.length; i++) {
                System.out.print(resultArr1[i] +"; ");
            }
            System.out.println();

            System.out.println("\n#2 \n");
            int[] subSubResultArr2 = new int[arr1.length];
            int nextIndexSubSubR = 0;

            for (int i = 0; i < arr1.length; i++) {
                boolean notFound = true;
                for (int j = 0; j < arr2.length && notFound; j++) {
                    if(arr1[i] == arr2[j]){
                        subSubResultArr2[nextIndexSubSubR] = arr1[i];
                        nextIndexSubSubR++;
                        notFound = false;
                    }
                }
            }

            for (int i = 0; i < subSubResultArr2.length; i++) {
                System.out.print(subSubResultArr2[i] + " ");
            }
            System.out.println();

            int[] subResultArr2 = new int[subSubResultArr2.length];
            int nextIndexSubR = 0;

            for (int i = 0; i < nextIndexSubSubR; i++) {
                boolean notFound = true;
                for (int j = 0; j < nextIndexSubR && notFound; j++) {
                    if(subSubResultArr2[i] == subResultArr2[j]){
                        notFound = false;
                    }
                }
                if(notFound){
                    subResultArr2[nextIndexSubR] = subSubResultArr2[i];
                    nextIndexSubR++;
                }
            }

            int[] resultArr2 = new int[nextIndexSubR];

            for (int i = 0; i < nextIndexSubR; i++) {
                resultArr2[i] = subResultArr2[i];
            }
            System.out.println();


            for (int i = 0; i <resultArr2.length; i++) {
                System.out.print(resultArr2[i] +"; ");
            }
            System.out.println();

            System.out.println("\n#3 \n");

            int minR3 = arr1[0];
            int maxR3 = arr1[0];

            for (int i = 0; i < resultArr2.length; i++) {
                if(minR3 > resultArr2[i]){
                    minR3 = resultArr2[i];
                }
                if(maxR3 < resultArr2[i]){
                    maxR3 = resultArr2[i];
                }
            }


            System.out.println("min=" + minR3);
            System.out.println("max=" + maxR3);

            int[] resultArr3 = new int[ (int)( Math.sqrt(Math.pow((maxR3 - minR3),2)) ) + 1 ];

            resultArr3[0] = minR3;
            for (int i = 1; i < resultArr3.length; i++) {
                resultArr3[i] = resultArr3[i-1]+1;
            }

            for (int i = 0; i <resultArr3.length; i++) {
                System.out.print(resultArr3[i] +"; ");
            }
            System.out.println();
        }

        {