Cody

Problem 577. Repopulate the City

Solution 1733621

Submitted on 22 Feb 2019 by HH
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
pmin = 20; pmax = 30; d = [1 2 3 4 5]; n = [10 9 4 7 2]; p = fit_distribution(d,n,pmin,pmax) assert(~any(p<pmin) && ~any(p>pmax)) for i = 1:length(d) assert(isequal(n(i), sum(rem(p,d(i))==0))) end

a = 10×1 cell array {1×11 double} {1×11 double} {1×11 double} {1×11 double} {1×11 double} {1×11 double} {1×11 double} {1×11 double} {1×11 double} {1×11 double} p = 23 22 22 28 20 20 24 24 24 24
2   Pass
pmin = 1; pmax = 50; d = [1 3 5 7 8 9]; n = [40 14 12 6 4 1]; p = fit_distribution(d,n,pmin,pmax); assert(~any(p<pmin) && ~any(p>pmax)) for i = 1:length(d) assert(isequal(n(i), sum(rem(p,d(i))==0))) end

a = 40×1 cell array {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double} {1×50 double}
3   Pass
pmin = 100; pmax = 200; d = [1 8 9 15 22]; n = [20 2 1 0 2]; p = fit_distribution(d,n,pmin,pmax); assert(~any(p<pmin) && ~any(p>pmax)) for i = 1:length(d) assert(isequal(n(i), sum(rem(p,d(i))==0))) end

a = 20×1 cell array {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double} {1×101 double}
4   Pass
pmin = 5; pmax = 37; d = [1 10 20 3 11]; n = [60 7 1 19 5]; p = fit_distribution(d,n,pmin,pmax); assert(~any(p<pmin) && ~any(p>pmax)) for i = 1:length(d) assert(isequal(n(i), sum(rem(p,d(i))==0))) end

a = 60×1 cell array {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double} {1×33 double}

Suggested Problems

More from this Author49