Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1; y_correct = 6;
assert(isequal(surface_points(x),y_correct))
y =
6
|
2 | Pass |
x = 1024; y_correct = 6;
assert(isequal(surface_points(x),y_correct))
y =
6
|
3 | Pass |
x = 7581; y_correct = 108270;
assert(isequal(surface_points(x),y_correct))
y =
108270
|
4 | Pass |
x = 450; y_correct = 2550;
assert(isequal(surface_points(x),y_correct))
y =
2550
|
5 | Pass |
x = 123456; y_correct = 19350;
assert(isequal(surface_points(x),y_correct))
y =
19350
|
6 | Pass |
x=ceil(rand*8); y_correct=[6 30 30 150 510 4590 4590 43470];
assert(isequal(surface_points(factorial(x+1)),y_correct(x)))
y =
43470
|
Find the sum of all the numbers of the input vector
25604 Solvers
Test if a Number is a Palindrome without using any String Operations
157 Solvers
Longest run of consecutive numbers
191 Solvers
323 Solvers
Without the French accent please!
76 Solvers