Cody

Problem 44793. Project Euler 249: Prime Subset Sums

Solution 1788295

Submitted on 15 Apr 2019
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
tic; SUM = euler249(10) toc; assert(isequal(SUM, uint64(7)))

num = uint64 7 SUM = uint64 7 Elapsed time is 0.005022 seconds.

2   Fail
tic; SUM = euler249(100) toc; assert(isequal(SUM, uint64(5253640)))

num = uint64 7 SUM = uint64 7 Elapsed time is 0.000316 seconds.

Assertion failed.

3   Fail
tic; SUM = euler249(1000) toc; assert(isequal(SUM, uint64(5725053962252706)))

num = uint64 7 SUM = uint64 7 Elapsed time is 0.000309 seconds.

Assertion failed.

4   Fail
tic; SUM = euler249(2000) toc; assert(isequal(SUM, uint64(9536598422264105)))

num = uint64 7 SUM = uint64 7 Elapsed time is 0.000337 seconds.

Assertion failed.

5   Fail
tic; SUM = euler249(4900) toc; assert(isequal(SUM, uint64(2455225028344813)))

num = uint64 7 SUM = uint64 7 Elapsed time is 0.000873 seconds.

Assertion failed.

Suggested Problems

More from this Author4

Community Treasure Hunt

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

Start Hunting!