-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEvenCombinations.java
More file actions
78 lines (54 loc) · 1.33 KB
/
Copy pathEvenCombinations.java
File metadata and controls
78 lines (54 loc) · 1.33 KB
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
import java.util.Scanner;
public class EvenCombinations {
private int count = 0;
public EvenCombinations() {
}
private boolean even(int[] list) {
int total = 0;
for (int i = 0; i < list.length; i++) {
total += list[i];
}
return ((total % 2) == 0);
}
public void combinations(int[] list) {
count = 0;
for (int i = 1; i <= list.length; i++) {
int[] data = new int[i];
combinations(list, data, 0, list.length - 1, 0, i);
}
return;
}
private void combinations(int[] list, 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]);
}
if (even(data)) {
// System.out.println("...Even!");
count += 1;
} else {
// System.out.println();
}
return;
}
for (int i = start; (i <= end) && (end - i + 1 >= r - index); i++) {
data[index] = list[i];
combinations(list, data, i + 1, end, index + 1, r);
}
}
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] list = new int[n];
for (int i = 0; i < n; i++) {
list[i] = in.nextInt();
}
for (int i = 0; i < n; i++) {
// System.out.print(list[i] + ", ");
}
EvenCombinations work = new EvenCombinations();
work.combinations(list);
System.out.println(work.count);
in.close();
}
}