Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 3276;
y_correct = 5;
assert(isequal(KaprekarSteps(x),y_correct))
|
2 | Pass |
x = 3;
y_correct = 6;
assert(isequal(KaprekarSteps(x),y_correct))
|
3 | Pass |
x = 691;
y_correct = 7;
assert(isequal(KaprekarSteps(x),y_correct))
|
4 | Pass |
x = 3333;
y_correct = Inf;
assert(isequal(KaprekarSteps(x),y_correct))
|
5 | Pass |
x = 1;
y_correct = 5;
assert(isequal(KaprekarSteps(x),y_correct))
|
6 | Pass |
x = 6174;
y_correct = 0;
assert(isequal(KaprekarSteps(x),y_correct))
|
7 | Pass |
x = 1234;
y_correct = 3;
assert(isequal(KaprekarSteps(x),y_correct))
|
8 | Pass |
x = 3141;
y_correct = 5;
assert(isequal(KaprekarSteps(x),y_correct))
|
9 | Pass |
x = 8080;
y_correct = 6;
assert(isequal(KaprekarSteps(x),y_correct))
|
Sort a list of complex numbers based on far they are from the origin.
3790 Solvers
1312 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
356 Solvers
250 Solvers