In this problem, what if we are given a rectangle of side a*b instead of a square (a*a)?

In other words, how many minimum rectangles with sides a*b would be required to cover the surface of a rectangle n*m?

(Note: We can rotate the rectangles by 90°)

Thanks a lot in advance.

This is similar to counting tiles in CSES do check it out.

Nope, counting tiles in CSES fixes the sizes at 1x2 and asks how many ways to fill, not the minimum number of tiles needed to fill.

Somewhat similar but in this case smaller rectangles are allowed to cross the boundaries of the bigger rectangle.

Also here we need to count total number of rectangles needed instead of total possible ways.

Can we rotate the rectangles by an angle not divisible by $$$90^\circ$$$?

No the sides must be parallel to the bigger rectangle.

Auto comment: topic has been updated by greentree888 (previous revision, new revision, compare).The only helpful?? idea that occured to me is:

Only right and bottom sides can be run over in an optimal solution.