Any integer-sided rectangle can be cut into unit rectangles (
) and rearranged into sets of smaller rectangles. For example the 
rectangle can be broken as follows:
) and rearranged into sets of smaller rectangles. For example the rectangle can be broken as follows:
We call an integer rectangle as "squarable" if it can be can be broken (i.e. cut into unit rectangles and rearranged) into any number of non-unit squares of equal sizes. For example the 
rectangle can be broken into six 
squares. Therefore, the rectangle is squarable.
rectangle can be broken into six squares. Therefore, the rectangle is squarable.Integer rectangles that are not squarable are called "non-squarable". The rectangle, shown in the first example above, is a non-squarable rectangle. The complete set of non-squarable rectangles with area 
square units are as follows:
rectangle, shown in the first example above, is a non-squarable rectangle. The complete set of non-squarable rectangles with area square units are as follows:
Create a program that calculates the total area of all non-squarable integer rectangles whose areas are less than or equal to a given area limit A.
For 
, the program should output:
, the program should output:
NOTE: Reflections and rotations are not significant and should be counted only once.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
1375 Solvers
-
120 Solvers
-
Pattern Recognition 1 - Known Unit Length
70 Solvers
-
Return fibonacci sequence do not use loop and condition
851 Solvers
-
1313 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
