Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 1677661

Submitted on 21 Nov 2018 by Huajie Zheng
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
x = 20; y_correct = 232792560; assert(isequal(euler005(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In euler005 (line 2) In ScoringEngineTestPoint1 (line 3) In solutionTest (line 3)]
2   Pass
x = 10; y_correct = 2520; assert(isequal(euler005(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In euler005 (line 2) In ScoringEngineTestPoint2 (line 3) In solutionTest (line 5)]
3   Pass
x = 12; y_correct = 27720; assert(isequal(euler005(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In euler005 (line 2) In ScoringEngineTestPoint3 (line 3) In solutionTest (line 7)]
4   Pass
x = 14; y_correct = 360360; assert(isequal(euler005(x),y_correct))

[Warning: Too many FOR loop iterations. Stopping after 9223372036854775806 iterations.] [> In euler005 (line 2) In ScoringEngineTestPoint4 (line 3) In solutionTest (line 9)]

Suggested Problems

More from this Author52