@@ -0,0 +1,683 @@
+package t08_ExamPreparations.e11_20_November_2017_Evening;%0A%0Aimport java.util.Scanner;%0A%0Apublic class p06_MaxCombinations %7B%0A    public static void main(String%5B%5D args) %7B%0A        Scanner scan = new Scanner(System.in);%0A        int begin = Integer.parseInt(scan.nextLine());%0A        int end = Integer.parseInt(scan.nextLine());%0A        int max = Integer.parseInt(scan.nextLine());%0A%0A        int count = 0;%0A        for (int i = begin; i %3C= end; i++) %7B%0A            for (int j = begin; j %3C= end; j++) %7B%0A                count++;%0A                System.out.printf(%22%3C%25d-%25d%3E%22, i, j);%0A                if(count == max) %7B%0A                    return;%0A                %7D%0A            %7D%0A        %7D%0A    %7D%0A%7D%0A

solve task N 6