topcoder/src/NumbersChallenge.java at master · yuki2006/topcoder · GitHub

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
importjava.util.Arrays;


publicclassNumbersChallenge {
publicintMinNumber(int[] S) {
Arrays.sort(S);
intmax = 0;
for (ints : S) {
if (max >= s - 1) {
max += s;
 } else {
break;
 }
 }
returnmax + 1;

 }

// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit-pf 2.3.0
privatestaticbooleanKawigiEdit_RunTest(inttestNum, int[] p0, booleanhasAnswer, intp1) {
System.out.print("Test " + testNum + ": [" + "{");
for (inti = 0; p0.length > i; ++i) {
if (i > 0) {
System.out.print(",");
 }
System.out.print(p0[i]);
 }
System.out.print("}");
System.out.println("]");
NumbersChallengeobj;
intanswer;
obj = newNumbersChallenge();
longstartTime = System.currentTimeMillis();
answer = obj.MinNumber(p0);
longendTime = System.currentTimeMillis();
booleanres;
res = true;
System.out.println("Time: " + (endTime - startTime) / 1000.0 + " seconds");
if (hasAnswer) {
res = answer == p1;
 }
if (!res) {
System.out.println("DOESN'T MATCH!!!!");
if (hasAnswer) {
System.out.println("Desired answer:");
System.out.println("\t" + p1);
 }
System.out.println("Your answer:");
System.out.println("\t" + answer);
 } elseif ((endTime - startTime) / 1000.0 >= 2) {
System.out.println("FAIL the timeout");
res = false;
 } elseif (hasAnswer) {
System.out.println("Match :-)");
 } else {
System.out.println("OK, but is it right?");
 }
System.out.println("");
returnres;
 }

publicstaticvoidmain(String[] args) {
booleanall_right;
booleandisabled;
booleantests_disabled;
all_right = true;
tests_disabled = false;

int[] p0;
intp1;

// ----- test 0 -----
disabled = false;
p0 = newint[]{5, 1, 2};
p1 = 4;
all_right = (disabled || KawigiEdit_RunTest(0, p0, true, p1)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------

// ----- test 1 -----
disabled = false;
p0 = newint[]{2, 1, 4};
p1 = 8;
all_right = (disabled || KawigiEdit_RunTest(1, p0, true, p1)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------

// ----- test 2 -----
disabled = false;
p0 = newint[]{2, 1, 2, 7};
p1 = 6;
all_right = (disabled || KawigiEdit_RunTest(2, p0, true, p1)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------

// ----- test 3 -----
disabled = false;
p0 = newint[]{94512, 2, 87654, 81316, 6, 5, 6, 37151, 6, 139, 1, 36, 307, 1, 377, 101, 8, 37, 58, 1};
p1 = 1092;
all_right = (disabled || KawigiEdit_RunTest(3, p0, true, p1)) && all_right;
tests_disabled = tests_disabled || disabled;
// ------------------

// ----- test 4 -----
disabled = false;
p0 = newint[]{883, 66392, 3531, 28257, 1, 14131, 57, 1, 25, 88474, 4, 1, 110, 6, 1769, 220, 442, 7064, 7, 13};
p1 = 56523;
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!