Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if an area P can be obtained from an area of N * M

  • Last Updated : 05 May, 2021

Given integers N, M and P, the task is to check if is possible to find a rectangular area of P sq. units inside a rectangular area of N × M sq units.

Examples:

Input: N = 3, M = 3, P = 4
Output: YES
Explanation: Rectangle of 2 x 2 sq. unit area

Input: N = 4, M = 4, P = 7
Output: NO

Approach: Follow the steps below to solve the problem

  • Find all the factors of p and store them in the vector, say factors.
  • Maintain order N ≤ M.
  • Traverse the vector factors.
    • For each array element factors[i], check if factors[i] ≤ N and p / factors[i] ≤ M, where factors[i] and p / factors[i] represent dimensions of rectangular area.
    • If found to be true, print YES and return.
  • Otherwise, print NO

Below is the implementation of the above approach:

C++




// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if a rectangle
// of p sq units can be formed from
//  an area of n * m sq units
void splitArea(int n, int m, int p)
{
    // Maintain order n <= m
    if (n > m)
        swap(n, m);
 
    vector<int> factors;
 
    // Iterate to find factors of p
    for (int i = 1; i * i <= p; i++) {
 
        // p is divisible by i
        if (p % i == 0) {
            factors.push_back(i);
        }
    }
 
    for (int i = 0; i < (int)factors.size();
         i++) {
 
        // Check if dimensions
        // lie in given area
        if (factors[i] <= n &&
            p / factors[i] <= m) {
 
            cout << "YES";
            return;
        }
    }
 
    cout << "NO";
}
 
// Driver Code
int main()
{
    int n = 3, m = 3, p = 4;
    splitArea(n, m, p);
}
Java



// Java program for the above approach
import java.io.*;
import java.util.*;
 
class GFG
{
 
  // Function to swap two numbers
  // Using temporary variable
  static void swap(int m, int n)
  {
     
    // Swapping the values
    int temp = m;
    m = n;
    n = temp;
  }
 
  // Function to check if a rectangle
  // of p sq units can be formed from
  //  an area of n * m sq units
  static void splitArea(int n, int m, int p)
  {
 
    // Maintain order n <= m
    if (n > m)
      swap(n, m);
    ArrayList<Integer> factors = new ArrayList<Integer>();
 
    // Iterate to find factors of p
    for (int i = 1; i * i <= p; i++)
    {
 
      // p is divisible by i
      if (p % i == 0)
      {
        factors.add(i);
      }
    }
 
    for (int i = 0; i < (int)factors.size();
         i++)
    {
 
      // Check if dimensions
      // lie in given area
      if (factors.get(i) <= n &&
          p / factors.get(i) <= m)
      {
        System.out.print("YES");
        return;
      }
    }
 
    System.out.print("NO");
  }
 
 
// Driver code
public static void main(String[] args)
{
    int n = 3, m = 3, p = 4;
    splitArea(n, m, p);
}
}
 
// This code is contributed by code_hunt.
Python3



# Python3 program for the above approach
 
# Function to check if a rectangle
# of p sq units can be formed from
# an area of n * m sq units
def splitArea(n, m, p):
   
    # Maintain order n <= m
    if (n > m):
        n, m = m, n
    factors = []
 
    # Iterate to find factors of p
    for i in range(1, p + 1):
 
        # p is divisible by i
        if (p % i == 0):
            factors.append(i)
 
    for i in range(len(factors)):
       
        # Check if dimensions
        # lie in given area
        if (factors[i] <= n and p // factors[i] <= m):
            print("YES")
            return
 
    print("NO")
 
# Driver Code
if __name__ == '__main__':
    n, m, p = 3, 3, 4
    splitArea(n, m, p)
 
    # This code is contributed by mohit kumar 29.
C#



// C# Program to implement
// the above approach
using System;
using System.Collections.Generic;
 
class GFG
{
   
  // Function to swap two numbers
  // Using temporary variable
  static void swap(int m, int n)
  {
     
    // Swapping the values
    int temp = m;
    m = n;
    n = temp;
  }
 
  // Function to check if a rectangle
  // of p sq units can be formed from
  //  an area of n * m sq units
  static void splitArea(int n, int m, int p)
  {
 
    // Maintain order n <= m
    if (n > m)
      swap(n, m);
    List<int> factors = new List<int>();
 
    // Iterate to find factors of p
    for (int i = 1; i * i <= p; i++)
    {
 
      // p is divisible by i
      if (p % i == 0)
      {
        factors.Add(i);
      }
    }
 
    for (int i = 0; i < (int)factors.Count;
         i++)
    {
 
      // Check if dimensions
      // lie in given area
      if (factors[i] <= n &&
          p / factors[i] <= m)
      {
        Console.Write("YES");
        return;
      }
    }
 
    Console.Write("NO");
  }
 
  // Driver Code
  public static void Main(String[] args)
  {
    int n = 3, m = 3, p = 4;
    splitArea(n, m, p);
  }
}
 
// This code is contributed by splevel62.
Javascript



<script>
      // JavaScript program for the above approach
      // Function to swap two numbers
      // Using temporary variable
      function swap(m, n) {
        // Swapping the values
        var temp = m;
        m = n;
        n = temp;
      }
 
      // Function to check if a rectangle
      // of p sq units can be formed from
      // an area of n * m sq units
      function splitArea(n, m, p) {
        // Maintain order n <= m
        if (n > m) swap(n, m);
        var factors = new Array();
 
        // Iterate to find factors of p
        for (var i = 1; i * i <= p; i++) {
          // p is divisible by i
          if (p % i == 0) {
            factors.push(i);
          }
        }
 
        for (var i = 0; i < factors.length; i++) {
          // Check if dimensions
          // lie in given area
          if (factors[i] <= n && p / factors[i] <= m) {
            document.write("YES");
            return;
          }
        }
 
        document.write("NO");
      }
 
      // Driver code
      var n = 3,
        m = 3,
        p = 4;
      splitArea(n, m, p);
    </script>
 
 
Output: 
YES
 
 
Time Complexity: O(√P)
Auxiliary Space: O(log(P))
 

My Personal Notes
arrow_drop_up
Previous
Minimum array elements required to be subtracted from either end to reduce K to 0
Next

Count N-length Binary Strings consisting of "11" as substring
Recommended Articles
Page :
Check if N can be obtained from 1 by repetitively multiplying by 10 or 20
25, Jun 20
Check if N can be obtained by repetitive addition or subtraction of two given numbers
09, Jul 20
Check if sum Y can be obtained from the Array by the given operations
19, Aug 20
Check if K can be obtained by performing arithmetic operations on any permutation of an Array
07, Sep 20
Check if a permutation of S2 can be obtained by adding or removing characters from S1
29, Jun 21
Check if N can be obtained from 0 using at most X increment and at most Y doubling operations
19, Jan 22
Maximum array sum that can be obtained after exactly k changes
26, Mar 19
Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
04, Apr 19
Smallest array that can be obtained by replacing adjacent pairs with their products
04, Oct 20
Counts 1s that can be obtained in an Array by performing given operations
03, Jan 21
Minimum number that can be obtained by applying '+' and '*' operations on array elements
25, May 21
Maximum profit that can be obtained by buying at most K books
17, Jun 21
Lexicographically smallest permutation of length 2N that can be obtained from an N-length array satisfying given conditions
17, Jun 21
Count of different numbers divisible by 3 that can be obtained by changing at most one digit
05, Aug 21
Count subarrays having a single distinct element that can be obtained from a given array
22, Jan 21
Maximize sum that can be obtained from two given arrays based on given conditions
30, Jun 21
Minimum number of insertions required such that first K natural numbers can be obtained as sum of a subsequence of the array
14, Jul 21
Minimum integer that can be obtained by swapping adjacent digits of different parity
21, Jan 20
Print all numbers that can be obtained by adding A or B to N exactly M times
17, Jun 21
Check if N rectangles of equal area can be formed from (4 * N) integers
06, Jan 20
Calculate Volume, Curved Surface Area and Total Surface Area Of Cylinder
16, Nov 17
Find area of the larger circle when radius of the smaller circle and difference in the area is given
30, Jul 19
Radius of a circle having area equal to the sum of area of the circles having given radii
17, Jan 21
Find area of the Circle when the area of inscribed Square is given
25, Oct 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
single__loop
@single__loop
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!