Cody

Problem 252. Project Euler: Problem 16, Sums of Digits of Powers of Two

Solution 2546730

Submitted on 14 Jun 2020
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
x = 0; y_correct = 1; assert(isequal(pow2_sumofdigits(x),y_correct))

n = '1' y = 1

2   Pass
x = 1; y_correct = 2; assert(isequal(pow2_sumofdigits(x),y_correct))

n = '2' y = 2

3   Pass
x = 15; y_correct = 26; assert(isequal(pow2_sumofdigits(x),y_correct))

n = '32768' y = 26

4   Fail
x = 345; y_correct = 521; assert(isequal(pow2_sumofdigits(x),y_correct))

n = '7.167183174968973e+103' y = []

Assertion failed.

5   Fail
x = 999; y_correct = 1367; assert(isequal(pow2_sumofdigits(x),y_correct))

n = '5.357543035931337e+300' y = []

Assertion failed.

6   Fail
x = 2000; y_correct = 2704; assert(isequal(pow2_sumofdigits(x),y_correct))

n = 'Inf' y = []

Assertion failed.