Cody

# Problem 44793. Project Euler 249: Prime Subset Sums

Solution 1679273

Submitted on 23 Nov 2018
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   Fail
tic; SUM = euler249(10) toc; assert(isequal(SUM, uint64(7)))

SUM = uint64 1 Elapsed time is 0.024959 seconds.

Assertion failed.

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

SUM = uint64 1 Elapsed time is 0.006747 seconds.

Assertion failed.

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

SUM = uint64 1 Elapsed time is 0.102185 seconds.

Assertion failed.

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

SUM = uint64 1 Elapsed time is 0.629319 seconds.

Assertion failed.

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

SUM = uint64 1 Elapsed time is 7.619238 seconds.

Assertion failed.