Find if there exists multiple ways to draw line through (x, y) to cut rectangle in equal halfs

Given four integers W, H, x and y. The task is to find if there exists multiple ways to draw a line through (x, y) to cut the rectangle into two equal parts. If there are multiple ways print Yes otherwise print No. The co-ordinates of rectangle are (0, 0), (W, 0), (W, H) and (0, H).
Note: The point (x, y) always lies inside or above the rectangle.

Examples:

Input: W = 2, H = 2, x = 1, y = 1
Output: Yes
Line segment joining the points (0, 0) and (2, 2)
or (0, 2) and (2, 0) etc. are all valid ways.

Input: W = 1, H = 3, x = 1, y = 2
Output: No

Approach: The rectangle can be divided into two equal parts when the line is is drawn vertically, horizontally or diagonally through the centre of the rectangle. So, the answer will be Yes only if the point (x, y) is the centre of the rectangle i.e. (W / 2, H / 2) otherwise the answer will be No.



Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
// Function that returns true if multiple
// lines are possible passing through
// (x, y) that divide the given
// rectangle into two equal parts
int isPossible(int w, int h, int x, int y)
{
  
    // If the point (x, y) is the
    // centre of the rectangle
    if (x * 2 == w && y * 2 == h)
        return true;
  
    return false;
}
  
// Driver code
int main()
{
    int w = 1, h = 2, x = 1, y = 2;
  
    if (isPossible(w, h, x, y))
        cout << "Yes";
    else
        cout << "No";
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the approach
class GFG
{
  
// Function that returns true if multiple
// lines are possible passing through
// (x, y) that divide the given
// rectangle into two equal parts
static boolean isPossible(int w, int h, int x, int y)
{
  
    // If the point (x, y) is the
    // centre of the rectangle
    if (x * 2 == w && y * 2 == h)
        return true;
  
    return false;
}
  
// Driver code
public static void main(String[] args)
{
    int w = 1, h = 2, x = 1, y = 2;
  
    if (isPossible(w, h, x, y))
        System.out.print("Yes");
    else
        System.out.print("No");
}
}
  
// This code contributed by PrinciRaj1992

chevron_right


Python 3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python 3 implementation of the approach
  
# Function that returns true if multiple
# lines are possible passing through
# (x, y) that divide the given
# rectangle into two equal parts
def isPossible(w, h, x, y):
      
    # If the point (x, y) is the
    # centre of the rectangle
    if (x * 2 == w and y * 2 == h):
        return True
  
    return False
  
# Driver code
if __name__ == '__main__':
    w = 1
    h = 2
    x = 1
    y = 2
  
    if (isPossible(w, h, x, y)):
        print("Yes")
    else:
        print("No")
  
# This code is contributed by Surendra_Gangwar

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation of the approach
using System;
  
class GFG
{
      
// Function that returns true if multiple
// lines are possible passing through
// (x, y) that divide the given
// rectangle into two equal parts
static bool isPossible(int w, int h, 
                       int x, int y)
{
  
    // If the point (x, y) is the
    // centre of the rectangle
    if (x * 2 == w && y * 2 == h)
        return true;
  
    return false;
}
  
// Driver code
static public void Main ()
{
    int w = 1, h = 2, x = 1, y = 2;
  
    if (isPossible(w, h, x, y))
        Console.Write("Yes");
    else
        Console.Write("No");
}
}
  
// This code is contributed by ajit.

chevron_right


Output:

No

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.




My Personal Notes arrow_drop_up

Recommended Posts:


pawanasipugmailcom

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.