Question: I need an algorithm ( With C++ code ) for the following problem : I have some covers of size : (2.4,1.2) meter (Width, Height).

I need an algorithm ( With C++ code ) for the following problem :

I have some covers of size : (2.4,1.2) meter (Width, Height). I want to cover different size of field with it (example: (9,5) meter (width, height) , the covers can be rotated as we like.

I just want to find the number minimum number of the covers required to cover the fields of different sizes.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!