combs

package com.company.Recursion.problems;

import java.util.Scanner;

public class Combs_NB {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n=input.nextInt();
        int[]set=new int[n];
        int[]result=new int[3];
        fillSet(set);
        //printSet(set);
        genComb(0,set,result,-1);

    }

    private static void genComb(int index, int[] set,int[]result, int limit) {
        if(index==result.length){
            printResult(result);
        }else{
            for (int i = limit+1; i <set.length ; i++) {
                result[index]=set[i];
                genComb(index+1,set,result,i);
            }

        }
    }

    private static void printResult(int[] set) {
        for (int i : set) {
            System.out.print(i+" ");
        }
        System.out.println();
    }

    private static int[] fillSet(int[] set) {
        for (int index = 0; index <set.length ; index++) {
            set[index]=index+1;
        }
        return set;
    }
}