Problem 648. Cumulative probability of finding an unlikely combination

Solution 85685

Submitted on 4 May 2012 by @bmtran (Bryant Tran)

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

@bmtran (Bryant Tran) on 4 May 2012

ironic solution ftw!

Doug Hull on 8 May 2012

I should have known! :) Next problem is, how many times can you expect to submit that solution! :)

Peter Wittenberg on 18 Aug 2012

OK. You've gamed the solution. The author shouldn't have to beef up the test suite to prevent this sort of solution.

Test	Status	Code Input and Output
1	Pass	%% g = 0.9; f = 10; tr = 1; tm = 2; n = 10; out = 0; assert(isequal(chaosOrOrder(g,f,tr,tm,n),out))
2	Pass	%% g = 0.9; f = 10; tr = 1; tm = 2; n = 100; out = 1; assert(isequal(chaosOrOrder(g,f,tr,tm,n),out))
3	Pass	%% g = 0.9; f = 10; tr = .1; tm = 2; n = 10000; out = 0; assert(isequal(chaosOrOrder(g,f,tr,tm,n),out))

Test

Status

Code Input and Output

Pass

%% g = 0.9; f = 10; tr = 1; tm = 2; n = 10; out = 0; assert(isequal(chaosOrOrder(g,f,tr,tm,n),out))

Pass

%% g = 0.9; f = 10; tr = 1; tm = 2; n = 100; out = 1; assert(isequal(chaosOrOrder(g,f,tr,tm,n),out))

Pass

%% g = 0.9; f = 10; tr = .1; tm = 2; n = 10000; out = 0; assert(isequal(chaosOrOrder(g,f,tr,tm,n),out))