Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [100 23 -34 0.005 -0.466664 -0.555 1 134534];
y_correct = [1 2 3 5 4 5 1 1];
assert(isequal(leadingDigit(x),y_correct))
[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.]
[> In unix (line 32)
In leadingDigit (line 2)
In ScoringEngineTestPoint1 (line 3)
In solutionTest (line 3)]
|
2 | Pass |
x = [57 -0.2 8913 -63 0.838127];
y_correct = [5 2 8 6 8];
assert(isequal(leadingDigit(x),y_correct))
[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.]
[> In unix (line 32)
In leadingDigit (line 2)
In ScoringEngineTestPoint2 (line 3)
In solutionTest (line 5)]
|
3 | Pass |
x = [-0.4336 0.3426 3.5784 2.7694 -1.3499];
y_correct = [4 3 3 2 1];
assert(isequal(leadingDigit(x),y_correct))
[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.]
[> In unix (line 32)
In leadingDigit (line 2)
In ScoringEngineTestPoint3 (line 3)
In solutionTest (line 7)]
|
4 | Pass |
x = [0.3000 -0.1 -0.00000002 0.5 0.002];
y_correct = [3 1 2 5 2];
assert(isequal(leadingDigit(x),y_correct))
[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.]
[> In unix (line 32)
In leadingDigit (line 2)
In ScoringEngineTestPoint4 (line 3)
In solutionTest (line 9)]
|
Remove the polynomials that have positive real elements of their roots.
448 Solvers
Find nearest prime number less than input number
183 Solvers
241 Solvers
341 Solvers
250 Solvers