Number of ways N can be divided into four parts to construct a rectangle
Last Updated :
10 Mar, 2022
Given an integer N, the task is to divide the number into four parts such that the divided parts can be used to construct a rectangle but not a square. Find how many numbers of ways are there so that the number can be divided fulfilling the condition.
Examples:
Input: N = 8
Output: 1
Input: N = 10
Output: 2
Approach: As the number has to be divided such that rectangle is formed from the divided four parts, so if the number is odd, then the number of ways will be zero, as perimeter of a rectangle is always even
Now, if n is even, then only (n – 2) / 4 number of ways are there to divide the number, for example,
if 8 has to be divided in four parts then there is only (8 – 2) / 4 = 1 way, i.e., [1, 1, 3, 3], no other way is there. It’s because you can only take sides length < = n/2 – 1 to form a valid rectangle and from those n/2 – 1 rectangles count divide again by 2 to avoid double counting.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int cntWays( int n)
{
if (n % 2 == 1) {
return 0;
}
else {
return (n - 2) / 4;
}
}
int main()
{
int n = 18;
cout << cntWays(n);
return 0;
}
|
Java
class GFG
{
static int cntWays( int n)
{
if (n % 2 == 1 )
{
return 0 ;
}
else
{
return (n - 2 ) / 4 ;
}
}
public static void main (String[] args)
{
int n = 18 ;
System.out.println(cntWays(n));
}
}
|
Python3
def cntWays(n) :
if n % 2 = = 1 :
return 0
else :
return (n - 2 ) / / 4
n = 18
print (cntWays(n))
|
C#
using System;
class GFG
{
static int cntWays( int n)
{
if (n % 2 == 1)
{
return 0;
}
else
{
return (n - 2) / 4;
}
}
public static void Main (String[] args)
{
int n = 18;
Console.WriteLine(cntWays(n));
}
}
|
Javascript
<script>
function cntWays(n)
{
if (n % 2 == 1)
{
return 0;
}
else
{
return (n - 2) / 4;
}
}
var n = 18;
document.write(cntWays(n));
</script>
|
Time Complexity: O(1)
Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...