Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
m=0;
n=1;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
|
2 | Fail |
m=0;
n=1024;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
|
3 | Fail |
m=0;
n=randi(1024)
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
n =
200
|
4 | Fail |
m=1;
n=1024
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
1024
|
5 | Fail |
m=1;
n=randi(1024)
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
820
|
6 | Fail |
m=2;
n=randi(128)
Ack = 2*n+3;
assert(isequal(ackermann(m,n),Ack))
n =
126
|
7 | Fail |
m=3;
n=6;
Ack = 509;
assert(isequal(ackermann(m,n),Ack))
|
8 | Fail |
m=3;
n=randi(6)
Ack = 2^(n+3)-3;
assert(isequal(ackermann(m,n),Ack))
n =
6
|
9 | Fail |
m=4;
n=0;
Ack = 13;
assert(isequal(ackermann(m,n),Ack))
|
10 | Fail |
m=4;
n=1; % Fails at RecursionLimit 1030; Create Special
Ack = 65533;
assert(isequal(ackermann(m,n),Ack))
|
2723 Solvers
Is my wife right? Now with even more wrong husband
1145 Solvers
String substitution, sub problem to cryptoMath
104 Solvers
397 Solvers
166 Solvers