Cody

Problem 54. Maximum running product for a string of numbers

Solution 1595170

Submitted on 29 Jul 2018 by Hans Hudyncia
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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 index = 3 i = 3
2   Pass
s = '5820974944592307816406286208998628034825342117067'; i_correct = 28; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 30 5 8 2 0 9 7 4 9 4 4 5 9 2 3 0 7 8 1 6 4 0 6 2 8 6 2 0 8 9 9 Columns 31 through 49 8 6 2 8 0 3 4 8 2 5 3 4 2 1 1 7 0 6 7 index = 28 i = 28
3   Pass
s = '141592653589793238462643383279502884197169399399999'; i_correct = 47; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 30 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 Columns 31 through 51 5 0 2 8 8 4 1 9 7 1 6 9 3 9 9 3 9 9 9 9 9 index = 47 i = 47
4   Pass
s = '7831652712019091456485669234603486104543266482133936072602'; i_correct = 21; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 30 7 8 3 1 6 5 2 7 1 2 0 1 9 0 9 1 4 5 6 4 8 5 6 6 9 2 3 4 6 0 Columns 31 through 58 3 4 8 6 1 0 4 5 4 3 2 6 6 4 8 2 1 3 3 9 3 6 0 7 2 6 0 2 index = 21 i = 21
5   Pass
s = '70066063155881748815209209628292540917153643678925903600113305305488'; i_correct = 44; assert(isequal(running_product(s),i_correct))

s = Columns 1 through 30 7 0 0 6 6 0 6 3 1 5 5 8 8 1 7 4 8 8 1 5 2 0 9 2 0 9 6 2 8 2 Columns 31 through 60 9 2 5 4 0 9 1 7 1 5 3 6 4 3 6 7 8 9 2 5 9 0 3 6 0 0 1 1 3 3 Columns 61 through 68 0 5 3 0 5 4 8 8 index = 44 i = 44
6   Pass
s = '11111'; i_correct = 1; assert(isequal(running_product(s),i_correct))

s = 1 1 1 1 1 index = 1 i = 1

Suggested Problems

More from this Author95