-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathORSolitaireDiv2.java
141 lines (128 loc) · 3.59 KB
/
ORSolitaireDiv2.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
141
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
public class ORSolitaireDiv2 {
public int getMinimum(int[] numbers, int goal) {
boolean[] bits = new boolean[32];
int res=1<<30;
for (int i = 0; i < 31; i++) {
if ( (goal & 1 << i) ==0 )
{
continue;
}
int cnt = 0;
for (int n:numbers )
{
cnt +=(( goal | n ) == goal && (( n & 1 << i )>0))?1:0;
}
res = Math.min( res, cnt );
bits[i] = ((1 << i & goal) > 0);
}
return res;
}
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit-pf 2.3.0
private static boolean KawigiEdit_RunTest(int testNum, int[] p0, int p1, boolean hasAnswer, int p2) {
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("}" + "," + p1);
System.out.println("]");
ORSolitaireDiv2 obj;
int answer;
obj = new ORSolitaireDiv2();
long startTime = System.currentTimeMillis();
answer = obj.getMinimum(p0, p1);
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" + p2);
}
System.out.println("Your answer:");
System.out.println("\t" + answer);
if (hasAnswer) {
res = answer == p2;
}
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;
int[] p0;
int p1;
int p2;
// ----- test 0 -----
disabled = false;
p0 = new int[]{1,2,4};
p1 = 7;
p2 = 1;
all_right = (disabled || KawigiEdit_RunTest(0, p0, p1, true, p2) ) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 1 -----
disabled = false;
p0 = new int[]{1,2,4,7,8};
p1 = 7;
p2 = 2;
all_right = (disabled || KawigiEdit_RunTest(1, p0, p1, true, p2) ) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 2 -----
disabled = false;
p0 = new int[]{12571295,2174218,2015120};
p1 = 1;
p2 = 0;
all_right = (disabled || KawigiEdit_RunTest(2, p0, p1, true, p2) ) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 3 -----
disabled = false;
p0 = new int[]{5,2,4,52,62,9,8,3,1,11,6};
p1 = 11;
p2 = 3;
all_right = (disabled || KawigiEdit_RunTest(3, p0, p1, true, p2) ) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------
// ----- test 4 -----
disabled = false;
p0 = new int[]{503,505,152,435,491,512,1023,355,510,500,502,255,63,508,509,511,60,250,254,346};
p1 = 510;
p2 = 5;
all_right = (disabled || KawigiEdit_RunTest(4, p0, p1, true, p2) ) && 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!