31 lines
746 B
Java
31 lines
746 B
Java
package nyagami;
|
|
|
|
import java.util.Scanner;
|
|
import java.util.Stack;
|
|
|
|
public class test{
|
|
static int n, k, cnt=0;
|
|
static void Try(int i, int start, int[] res){
|
|
if(i==k){
|
|
cnt++;
|
|
for(int j=0; j<k; j++){
|
|
System.out.print(res[j]);
|
|
}
|
|
System.out.print(" ");
|
|
return;
|
|
}
|
|
for(int u=start; u<=n-k+i+1 ; u++){
|
|
res[i]=u;
|
|
Try(i+1,u+1,res);
|
|
}
|
|
}
|
|
public static void main(String[] arg){
|
|
Scanner sc = new Scanner(System.in);
|
|
n = sc.nextInt(); k = sc.nextInt();
|
|
int[] res = new int[k];
|
|
Try(0,1,res);
|
|
System.out.printf("\nTong cong co %d to hop", cnt);
|
|
sc.close();
|
|
}
|
|
}
|