Cody

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

Solution 663527

Submitted on 30 Apr 2015 by Zikobrelli
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))

A = 0 1 1 2 15 26 345 521 999 1367 2000 2704 ans = 1

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

A = 0 1 1 2 15 26 345 521 999 1367 2000 2704 ans = 2

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

A = 0 1 1 2 15 26 345 521 999 1367 2000 2704 ans = 26

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

A = 0 1 1 2 15 26 345 521 999 1367 2000 2704 ans = 521

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

A = 0 1 1 2 15 26 345 521 999 1367 2000 2704 ans = 1367

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

A = 0 1 1 2 15 26 345 521 999 1367 2000 2704 ans = 2704