- Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathSquareDigitNumbers.java
More file actions
Latest commit
146 lines (127 loc) · 3.09 KB
/
Copy pathSquareDigitNumbers.java
File metadata and controls
146 lines (127 loc) · 3.09 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
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
142
143
144
145
146
// Paste me into the FileEdit configuration dialog
publicclassSquareDigitNumbers {
publicintgetNumber(intn) {
intsquare[] = { 0, 1, 4, 9 };
intresult = 0;
intbase = 1;
while (n > 0) {
result += square[n % 4] * base;
n = n / 4;
base *= 10;
}
returnresult;
}
// BEGIN CUT HERE
publicstaticvoidmain(String[] args) {
if (args.length == 0) {
SquareDigitNumbersHarness.run_test(-1);
} else {
for (inti = 0; i < args.length; ++i)
SquareDigitNumbersHarness.run_test(Integer.valueOf(args[i]));
}
}
// END CUT HERE
}
// BEGIN CUT HERE
classSquareDigitNumbersHarness {
publicstaticvoidrun_test(intcasenum) {
if (casenum != -1) {
if (runTestCase(casenum) == -1)
System.err.println("Illegal input! Test case " + casenum + " does not exist.");
return;
}
intcorrect = 0, total = 0;
for (inti = 0;; ++i) {
intx = runTestCase(i);
if (x == -1) {
if (i >= 100)
break;
continue;
}
correct += x;
++total;
}
if (total == 0) {
System.err.println("No test cases run.");
} elseif (correct < total) {
System.err.println("Some cases FAILED (passed " + correct + " of " + total + ").");
} else {
System.err.println("All " + total + " tests passed!");
}
}
staticbooleancompareOutput(intexpected, intresult) {
returnexpected == result;
}
staticStringformatResult(intres) {
returnString.format("%d", res);
}
staticintverifyCase(intcasenum, intexpected, intreceived) {
System.err.print("Example " + casenum + "... ");
if (compareOutput(expected, received)) {
System.err.println("PASSED");
return1;
} else {
System.err.println("FAILED");
System.err.println(" Expected: " + formatResult(expected));
System.err.println(" Received: " + formatResult(received));
return0;
}
}
staticintrunTestCase(intcasenum__) {
switch (casenum__) {
case0: {
intn = 0;
intexpected__ = 0;
returnverifyCase(casenum__, expected__, newSquareDigitNumbers().getNumber(n));
}
case1: {
intn = 5;
intexpected__ = 11;
returnverifyCase(casenum__, expected__, newSquareDigitNumbers().getNumber(n));
}
case2: {
intn = 16;
intexpected__ = 100;
returnverifyCase(casenum__, expected__, newSquareDigitNumbers().getNumber(n));
}
case3: {
intn = 121;
intexpected__ = 1941;
returnverifyCase(casenum__, expected__, newSquareDigitNumbers().getNumber(n));
}
case4: {
intn = 123;
intexpected__ = 1949;
returnverifyCase(casenum__, expected__, newSquareDigitNumbers().getNumber(n));
}
// custom cases
case5: {
intn = 1000;
intexpected__ = 99440;
returnverifyCase(casenum__, expected__, new
SquareDigitNumbers().getNumber(n));
}
/*
* case 6: {
* int n = ;
* int expected__ = ;
*
* return verifyCase(casenum__, expected__, new
* SquareDigitNumbers().getNumber(n));
* }
*/
/*
* case 7: {
* int n = ;
* int expected__ = ;
*
* return verifyCase(casenum__, expected__, new
* SquareDigitNumbers().getNumber(n));
* }
*/
default:
return -1;
}
}
}
// END CUT HERE