-
Notifications
You must be signed in to change notification settings - Fork 1
/
PowersOfTwo.java
140 lines (129 loc) · 3.61 KB
/
PowersOfTwo.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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
public class PowersOfTwo {
public long count(long[] powers) {
HashSet<Long> set = new HashSet<>();
set.add(0L);
for (int i = 0; i < powers.length; i++) {
HashSet<Long> newSet = new HashSet<>();
for (Long l : set) {
newSet.add(l + powers[i]);
}
newSet.addAll(set);
set = newSet;
}
return set.size();
}
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit-pf 2.3.0
private static boolean KawigiEdit_RunTest(int testNum, long[] p0,
boolean hasAnswer, long p1) {
System.out.print("Test " + testNum + ": [" + "{");
for (int i = 0; p0.length > i; ++i) {
if (i > 0) {
System.out.print(",");
}
System.out.print(p0[i]);
}
System.out.print("}");
System.out.println("]");
PowersOfTwo obj;
long answer;
obj = new PowersOfTwo();
long startTime = System.currentTimeMillis();
answer = obj.count(p0);
long endTime = System.currentTimeMillis();
boolean res;
res = true;
System.out.println("Time: " + (endTime - startTime) / 1000.0
+ " seconds");
if (hasAnswer) {
System.out.println("Desired answer:");
System.out.println("\t" + p1);
}
System.out.println("Your answer:");
System.out.println("\t" + answer);
if (hasAnswer) {
res = answer == p1;
}
if (!res) {
System.out.println("DOESN'T MATCH!!!!");
} else if ((endTime - startTime) / 1000.0 >= 2) {
System.out.println("FAIL the timeout");
res = false;
} else if (hasAnswer) {
System.out.println("Match :-)");
} else {
System.out.println("OK, but is it right?");
}
System.out.println("");
return res;
}
public static void main(String[] args) {
boolean all_right;
boolean disabled;
boolean tests_disabled;
all_right = true;
tests_disabled = false;
long[] p0;
long p1;
// ----- test 0 -----
disabled = false;
p0 = new long[] { 1L, 2L };
p1 = 4L;
all_right = (disabled || KawigiEdit_RunTest(0, p0, true, p1))
&& all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 1 -----
disabled = false;
p0 = new long[] { 1L, 1L, 1L, 1L };
p1 = 5L;
all_right = (disabled || KawigiEdit_RunTest(1, p0, true, p1))
&& all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 2 -----
disabled = false;
p0 = new long[] { 1L, 2L, 2L, 2L, 4L, 4L, 16L };
p1 = 32L;
all_right = (disabled || KawigiEdit_RunTest(2, p0, true, p1))
&& all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 3 -----
disabled = false;
p0 = new long[] { 1L, 32L, 1L, 16L, 32L };
p1 = 18L;
all_right = (disabled || KawigiEdit_RunTest(3, p0, true, p1))
&& all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 4 -----
disabled = false;
p0 = new long[] { 1048576L, 1073741824L, 549755813888L,
70368744177664L, 4398046511104L, 262144L, 1048576L, 2097152L,
8796093022208L, 1048576L, 1048576L, 35184372088832L, 2097152L,
256L, 256L, 256L, 262144L, 1048576L, 1048576L, 70368744177664L,
262144L, 1048576L };
p1 = 18432L;
all_right = (disabled || KawigiEdit_RunTest(4, p0, true, p1))
&& all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
if (all_right) {
if (tests_disabled) {
System.out
.println("You're a stud (but some test cases were disabled)!");
} else {
System.out.println("You're a stud (at least on given cases)!");
}
} else {
System.out.println("Some of the test cases had errors.");
}
}
// END KAWIGIEDIT TESTING
}
// Powered by KawigiEdit-pf 2.3.0!