-
Notifications
You must be signed in to change notification settings - Fork 169
/
Copy path(6.5).java
80 lines (67 loc) · 1.52 KB
/
(6.5).java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
import java.lang.*;
import java.util.*;
// Method 1:
class Combinations{
static void makeCombiUtil(Vector<Integer> tmp, int n, int left, int k)
{
if (k == 0) {
System.out.println(tmp);
return;
}
for (int i = left; i <= n; ++i)
{
tmp.add(i);
makeCombiUtil(tmp, n, i + 1, k - 1);
tmp.remove(tmp.size()-1);
}
}
static void makeCombi(int n, int k)
{
Vector<Integer> tmp=new Vector<>();
makeCombiUtil(tmp, n, 1, k);
}
public static void main(String args[])
{
// given number
Scanner s=new Scanner(System.in);
int n = s.nextInt();
int k = s.nextInt();
makeCombi(n, k);
}
}
//Method 2:
class Comb {
static void combination(int arr[], int data[], int start,
int end, int index, int r)
{
if (index == r)
{
for (int j=0; j<r; j++)
System.out.print(data[j]+" ");
System.out.println("");
return;
}
for (int i=start; i<=end && end-i+1 >= r-index; i++)
{
data[index] = arr[i];
combination(arr, data, i+1, end, index+1, r);
}
}
static void print(int arr[], int n, int r)
{
int data[]=new int[r];
combination(arr, data, 0, n-1, 0, r);
}
public static void main (String[] args) {
Scanner s=new Scanner(System.in);
int n=s.nextInt();
int i=0,j=0;
int arr[]=new int[n];
for(i=1;i<=n;i++)
{
arr[j++]=i;
}
int r = s.nextInt();
print(arr, n, r);
}
}