In a certain chemical plant, 6 new pieces of cooling equipment (coolers) are to be installed in a vacant space. This vacant space was divided into a grid of 6 cells by 6 cells. Your task is to assign the 6 coolers to 6 cells in this grid with the following requirements:
For this problem, you are given a cost matrix (COST) in relation to the third requirement above. COST is a 6 x 6 matrix where the r,c-th element is the cost of assigning any cooler to row r, column c (All the coolers are identical). Write a function that accepts the matrix COST, and output the value of the minimum cost of installation. You are ensured that all elements of COST are integers in the range [1,1000].
In the sample test case below, the optimal placement is at the following rows: 4,3,3,2,2,2.
>> COST = [695 766 710 119 752 548; 318 796 755 499 256 139; 951 187 277 960 506 150; 35 490 680 341 700 258; 439 446 656 586 891 841; 382 647 163 224 960 255]; >> coolers(COST) ans = 1393
Meanwhile, the optimal placement for the case below is at rows: 5,6,5,6,5,6
>> COST = [815 617 918 76 569 312; 244 474 286 54 470 529; 930 352 758 531 455 988; 350 831 754 780 12 602; 197 586 381 935 163 263; 252 550 568 130 795 100]; >> coolers(COST) ans = 1521
Project Euler: Problem 3, Largest prime factor
264 Solvers
Back to basics 8 - Matrix Diagonals
727 Solvers
Set some matrix elements to zero
295 Solvers
Split a string into chunks of specified length
271 Solvers
Get an array of month-ends in a date range
50 Solvers
Solution 2188958
This passed because the grid is small. I knew I should have changed the problem to a 20 x 20 or 100 x 100 grid haha. Anyway, I'll make a harder version of this problem in the next series. :)
And i ll prove to you then it will still work :)
Yeah probably so. I don't even know if Cody has a memory limit or time limit so one can create test cases that can really filter unwanted solutions. oh well.