Cody

Problem 43109. How many complete pizzas (number 2)

Solution 1532633

Submitted on 17 May 2018 by Binbin Qi
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 = [1 3 12]; n = [2 6 8]; t = [1 2 1]; y_correct = 2; assert(isequal(completePizzas(x,n,t),y_correct))

2   Pass
x = [1 3 12]; n = [2 6 8]; t = [1 1 1]; y_correct = 2; assert(isequal(completePizzas(x,n,t),y_correct))

3   Pass
x = [1 3 12]; n = [2 6 8]; t = [1 1 2]; y_correct = 2; assert(isequal(completePizzas(x,n,t),y_correct))

4   Pass
x = [1 3 12]; n = [2 6 8]; t = [1 2 3]; y_correct = 1; assert(isequal(completePizzas(x,n,t),y_correct))

5   Pass
x = [1 3 58 41 24 7 5]; n = [2 6 8 50 5 4 3]; t = [1 2 3 1 4 2 3]; y_correct = 15; assert(isequal(completePizzas(x,n,t),y_correct))

Suggested Problems

More from this Author25

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!