Cody

# Problem 54. Maximum running product for a string of numbers

Solution 364463

Submitted on 4 Dec 2013 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
%% s = '123454321'; i_correct = 3; assert(isequal(running_product(s),i_correct))

s = 1 2 3 4 5 4 3 2 1 i = 3

2   Pass
%% s = '5820974944592307816406286208998628034825342117067'; i_correct = 28; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 16 5 8 2 0 9 7 4 9 4 4 5 9 2 3 0 7 Columns 17 through 32 8 1 6 4 0 6 2 8 6 2 0 8 9 9 8 6 Columns 33 through 48 2 8 0 3 4 8 2 5 3 4 2 1 1 7 0 6 Column 49 7 i = 28

3   Pass
%% s = '141592653589793238462643383279502884197169399399999'; i_correct = 47; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 16 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 Columns 17 through 32 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0 Columns 33 through 48 2 8 8 4 1 9 7 1 6 9 3 9 9 3 9 9 Columns 49 through 51 9 9 9 i = 47

4   Pass
%% s = '7831652712019091456485669234603486104543266482133936072602'; i_correct = 21; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 16 7 8 3 1 6 5 2 7 1 2 0 1 9 0 9 1 Columns 17 through 32 4 5 6 4 8 5 6 6 9 2 3 4 6 0 3 4 Columns 33 through 48 8 6 1 0 4 5 4 3 2 6 6 4 8 2 1 3 Columns 49 through 58 3 9 3 6 0 7 2 6 0 2 i = 21

5   Pass
%% s = '70066063155881748815209209628292540917153643678925903600113305305488'; i_correct = 44; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 16 7 0 0 6 6 0 6 3 1 5 5 8 8 1 7 4 Columns 17 through 32 8 8 1 5 2 0 9 2 0 9 6 2 8 2 9 2 Columns 33 through 48 5 4 0 9 1 7 1 5 3 6 4 3 6 7 8 9 Columns 49 through 64 2 5 9 0 3 6 0 0 1 1 3 3 0 5 3 0 Columns 65 through 68 5 4 8 8 i = 44

6   Pass
%% s = '11111'; i_correct = 1; assert(isequal(running_product(s),i_correct))

s = 1 1 1 1 1 i = 1