Number of unique rectangles formed using N unit squares - GeeksforGeeks

29 Nov, 2021
You are given N unit squares (squares with side length 1 unit), and you are asked to make rectangles using these squares. You have to count the number of rotationally unique rectangles than you can make. What does rotationally unique mean? Well, two rectangles are rotationally unique if one can’t be rotated to become equivalent to the other one. 
Example – The 4×2 rectangle can be rotated 90 degrees clockwise to make it the exact same as the 2×4 rectangle and so these are not rotationally unique.  
Examples : 
Input : N = 4
Output : 5
We can make following five rectangles 
1 x 1, 1 x 2, 2 x 2, 1 x 3 and 1 x 4

Input : N = 5
Output : 6

Input : 6
Output : 8
So how do we solve this problem? Every rectangle is uniquely determined by its length and its height. A rectangle of length = l and height = h then l * h <= n is considered equivalent to a rectangle with length = h and height = l provided l is not equal to h. If we can have some sort of “ordering” in these pairs then we can avoid counting (l, h) and (h, l) as different rectangles. One way to define such an ordering is: 
Assume that length <= height and count for all such pairs such that length*height <= n. We have, length <= height or, length*length <= length*height or, length*length <= n or, length <= sqrt(n) 
C++
Java
Python3
C#
PHP
Javascript
// C++ program to count rotationally equivalent// rectangles with n unit squares#include<bits/stdc++.h>using namespace std;  int countRect(int n){    int ans = 0;    for (int length = 1; length <= sqrt(n); ++length)    for (int height = length; height*length <= n; ++height)            // height >= length is maintained        ans++;    return ans;}  // Driver codeint main() {    int n = 5;    printf("%d", countRect(n));    return 0;}
// Java program to count rotationally equivalent// rectangles with n unit squaresclass GFG {          static int countRect(int n)    {        int ans = 0;                  for (int length = 1; length <= Math.sqrt(n);                                           ++length)            for (int height = length; height*length <= n;                                                ++height)                // height >= length is maintained                ans++;                      return ans;    }          //driver code    public static void main (String[] args)    {        int n = 5;                  System.out.print(countRect(n));    }}  // This code is contributed by Anant Agarwal.
   # Python3 program to count rotationally # equivalent rectangles with n unit squaresimport math  def countRect(n):      ans = 0    for length in range(1, int(math.sqrt(n)) + 1):        height = length        while(height * length <= n):                          # height >= length is maintained            ans += 1            height += 1    return ans  # Driver coden = 5print(countRect(n))  # This code is contributed by Anant Agarwal.
// C# program to count rotationally // equivalent rectangles with n unit// squaresusing System;  class GFG {          static int countRect(int n)    {        int ans = 0;        for (int length = 1;             length <= Math.Sqrt(n); ++length)                          for (int height = length;                      height*length <= n; ++height)                ans++;                          return ans;    }          //driver code    public static void Main()    {                  int n = 5;                  Console.Write(countRect(n));    }}  //This code is contributed by Anant Agarwal.
<?php// PHP program to count // rotationally equivalent // rectangles with n unit squaresfunction countRect($n){    $ans = 0;    for ($length = 1;          $length <= sqrt($n); $length++)    for ($height = $length;          $height * $length <= $n; $height++)            // height >= length is maintained        $ans++;    return $ans;}  // Driver code$n = 5;echo countRect($n);  // This code is contributed by @ajit?>
<script>  // Javascript program to count rotationally // equivalent rectangles with n unit// squaresfunction countRect(n){    let ans = 0;    for(let length = 1;             length <= parseInt(Math.sqrt(n), 10);           ++length)                    for(let height = length;                 height * length <= n;               ++height)            ans++;                    return ans;}  // Driver codelet n = 5;        document.write(countRect(n));  // This code is contributed by divyesh072019  </script>
Output : 
6 
This article is contributed by Hemang Sarkar. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 
jit_t
divyesh072019
square-rectangle
Geometric
Mathematical
Mathematical
Geometric
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Comments
Old Comments
Convex Hull | Set 1 (Jarvis's Algorithm or Wrapping)
Line Clipping | Set 1 (Cohen–Sutherland Algorithm)
Program for distance between two points on earth
Closest Pair of Points | O(nlogn) Implementation
Equation of circle when three points on the circle are given
Program for Fibonacci numbers
Write a program to print all permutations of a given string
C++ Data Types
Set in C++ Standard Template Library (STL)
Coin Change | DP-7