forked from chicuongit913/MumTestJavaExam
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolve.java
61 lines (43 loc) · 947 Bytes
/
solve.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
package mumTestPackage;
import static org.junit.jupiter.api.Assertions.*;
import java.time.Year;
import org.junit.jupiter.api.Test;
class MumTest16 {
@Test
void test() {
assertArrayEquals(new int[] {0, 0}, solve(10));
}
static int[] solve(int n){
int tenFactorial = caculateFactorial(n);
boolean factorialFound = false;
int x = 1;
int y = 1;
for(x = 1; x < 10; x++){
int xFactorial = caculateFactorial(x);
for (y = x; y < 10; y++) {
int yFactorial = caculateFactorial(y);
if((xFactorial + yFactorial) == tenFactorial) {
factorialFound = true;
break;
}
}
if(factorialFound)
break;
}
if(x == 10 && y == 10) {
x = 0;
y = 0;
}
return new int[] {x,y};
}
static int caculateFactorial(int n) {
if (n <= 0) {
return 0;
}
int nFactorial = 1;
for (int i = 1; i <=n; i++) {
nFactorial = nFactorial * i;
}
return nFactorial;
}
}