Question

code in C for There are multiple bomb and $100 dollar bills in a room. you must save the bills before the bombs explode. the room is partitioned into n×m cells. the rows of the room are numbered from 1 to n from north to south and the columns of the room are numbered feom 1 to m from west to east. the cell(i,j) lies at the intersection of the i-th row and the j-th column. each cell has either a bomb or 1 to 9 $100 dollor bills. when bomb explodes all the bills in the same row and same column as the bomb get incinerated. because you have some time before the bombs explode, you can swap the positions of some of the bills. this can be done qt most k times. please calculate the maximum number of bills that can be saved if all the bombs explode.

Answer 1

Idk

.

.

.

.

.

.

.

.

.

.

Idk

Go find yourself :\