Cody

Problem 3027. Legend of Zelda - Rupee Count (Item Purchase)

Solution 2168430

Submitted on 21 Mar 2020 by Stephen
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
r = [20,5,3,1,0,1,1,0,0,0,0]; i_arr_corr = {'Magic potion','Shovel','Bombs'}; r_rem_corr = 70; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));
2   Pass
r = [4,0,1,0,0,0,0,0,0,1,5]; i_arr_corr = {'Bow & Arrows','Shield','Magic potion'}; r_rem_corr = 14; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));
3   Pass
r = [194,27,13,5,3,2,1,0,1,0,1]; i_arr_corr = {'Bow & Arrows','Shield'}; r_rem_corr = 9; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));
4   Pass
r = [254,94,23,11,15,4,7,3,2,0,1]; i_arr_corr = {'Hookshot','Bow & Arrows','Magic potion','Shovel','Bombs'}; r_rem_corr = 49; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));
5   Pass
r = [255,94,24,13,15,4,7,3,2,2,1]; i_arr_corr = {'Hookshot','Bow & Arrows','Shield','Magic potion','Shovel','Bombs'}; r_rem_corr = 0; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));
6   Pass
r = [27,2,1,0,0,0,0,0,0,0,0]; i_arr_corr = {'Bombs'}; r_rem_corr = 22; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));
7   Pass
r_ind = randi(21); r = [r_ind,2,2,1,1,0,0,0,0,0,0]; i_arr_corr = {'Shovel'}; r_rem_corr = r_ind; [i_arr,r_rem] = rupee_count_items(r); assert(isequal(r_rem,r_rem_corr)); assert(isequal(i_arr,i_arr_corr));

Suggested Problems

More from this Author139

Community Treasure Hunt

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

Start Hunting!