Cody

Problem 44784. Project Euler: Problem 14 Longest Collatz sequence(harder version)

Solution 1670403

Submitted on 9 Nov 2018 by Binbin Qi
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
assessFunctionAbsence({'tic','toc','pause','etime','clock','now','str2num','timer'},'FileName','euler014_v2.m') 2

ans = 2
2   Pass
N = 2e8; num_correct = 169941673; len_correct = 954; tic [num, len] = euler014_v2(N); t=toc assert(t>1); assert(isequal(num, num_correct)); assert(isequal(len, len_correct)); 3

t = 11.3980 ans = 3
3   Pass
N = 4e8; num_correct = 268549803; len_correct = 965; tic [num, len] = euler014_v2(N); t=toc assert(t>1); assert(isequal(num, num_correct)); assert(isequal(len, len_correct));

t = 22.6570

Suggested Problems

More from this Author17

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!