-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLittleElephantAndDouble.java
131 lines (119 loc) · 3.47 KB
/
LittleElephantAndDouble.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
import java.util.Arrays;
public class LittleElephantAndDouble
{
public String getAnswer(int[] A)
{
Arrays.sort(A);
for (int i = 1; i < A.length; i++) {
if (A[i] % A[0] > 0) {
return "NO";
}
int num = A[i] / A[0];
if (num == 1 || isDouble(num)) {
} else {
return "NO";
}
}
return "YES";
}
boolean isDouble(int num) {
while (num > 1) {
if (num % 2 == 1) {
return false;
}
num /= 2;
}
return true;
}
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit-pfx 2.1.9
private static boolean KawigiEdit_RunTest(int testNum, int[] p0, boolean hasAnswer, String 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("]");
LittleElephantAndDouble obj;
String answer;
obj = new LittleElephantAndDouble();
long startTime = System.currentTimeMillis();
answer = obj.getAnswer(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.equals(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;
all_right = true;
int[] p0;
String p1;
// ----- test 0 -----
p0 = new int[] { 1, 2 };
p1 = "YES";
all_right = KawigiEdit_RunTest(0, p0, true, p1) && all_right;
// ------------------
// ----- test 1 -----
p0 = new int[] { 1, 2, 3 };
p1 = "NO";
all_right = KawigiEdit_RunTest(1, p0, true, p1) && all_right;
// ------------------
// ----- test 2 -----
p0 = new int[] { 4, 8, 2, 1, 16 };
p1 = "YES";
all_right = KawigiEdit_RunTest(2, p0, true, p1) && all_right;
// ------------------
// ----- test 3 -----
p0 = new int[] { 94, 752, 94, 376, 1504 };
p1 = "YES";
all_right = KawigiEdit_RunTest(3, p0, true, p1) && all_right;
// ------------------
// ----- test 4 -----
p0 = new int[] { 148, 298, 1184 };
p1 = "NO";
all_right = KawigiEdit_RunTest(4, p0, true, p1) && all_right;
// ------------------
// ----- test 5 -----
p0 = new int[] { 7, 7, 7, 7 };
p1 = "YES";
all_right = KawigiEdit_RunTest(5, p0, true, p1) && all_right;
// ------------------
// ----- test 5 -----
p0 = new int[] { 2, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 , 1000000000, 1000000000, 1000000000 };
p1 = "NO";
all_right = KawigiEdit_RunTest(5, p0, true, p1) && all_right;
// ------------------
if (all_right) {
System.out.println("You're a stud (at least on the example cases)!");
} else {
System.out.println("Some of the test cases had errors.");
}
}
// END KAWIGIEDIT TESTING
}
// Powered by KawigiEdit-pfx 2.1.9!