Given n points, we need to check if these n points are parallel to X axis or Y axis or to No axis.

Examples:

Input : x[] = {0, 0, 0, 0, 0| y[] = {9, 2, 1, 3, 4} Output : Parallel to X Axis Input : x[] = {1, 2, 3| y[] = {9, 2, 1} Output : Not Parallel to X or Y Axis

## Approach

To find the points parallel to X or Y axis just check if the points are same for any axis or not. If all the points on X axis are same then the line is parallel to X axis. If all the points on Y axis are same so the line is parallel to Y axis otherwise it is not parallel to any axis.

Input the value N. And then Input the value of points in a

## C++

[sourcecode language=”CPP”]

// CPP program to check for parallel

// to X and Y Axis

#include <bits/stdc++.h>

using namespace std;

// To check for parallel line

void parallel(int n, int a[][2])

{

bool x = true, y = true;

// checking for parallel to X and Y

// axis condition

for (int i = 0; i < n – 1; i++) {

for (int j = 0; j < 2; j++) {

if (a[i][0] != a[i + 1][0])

x = false;

if (a[i][1] != a[i + 1][1])

y = false;

}

}

// To display the output

if (x)

cout << "parallel to X Axis" << endl;

else if (y)

cout << "parallel to Y Axis" << endl;

else

cout << "Not parallel to X"

<< " and Y Axis" << endl;

}

// Driver’s Code

int main()

{

int a[][2] = { { 1, 2 },

{ 1, 4 },

{ 1, 6 },

{ 1, 0 } };

int n = sizeof(a) / sizeof(a[0]);

parallel(n, a);

return 0;

}

[/sourcecode]

## Java

[sourcecode language=”JAVA”]

// JAVA program to illustrate..

// To check for parallel

// To X and Y Axis

import java.io.*;

import java.util.*;

class GFG {

// To check for parallel line

static void parallel(int a[][])

{

boolean x = true, y = true;

// checking for parallel to X and Y

// axis condition

for (int i = 0; i < a.length – 1; i++) {

for (int j = 0; j < 2; j++) {

if (a[i][0] != a[i + 1][0])

x = false;

if (a[i][1] != a[i + 1][1])

y = false;

}

}

// To display the output

if (x)

System.out.println("Parallel to X Axis");

else if (y)

System.out.println("Parallel to Y Axis");

else

System.out.println("Not parallel to X" +

" and Y axis");

}

public static void main(String[] args)

{

int a[][] = { { 1, 2 },

{ 1, 4 },

{ 1, 6 },

{ 1, 0 } };

parallel(a);

}

}

[/sourcecode]

## PHP

[sourcecode language=”php”]

<?php

// PHP program to check for parallel

// to X and Y Axis

// To check for parallel line

function parallel($n, $a)

{

$x = true; $y = true;

// checking for parallel

// to X and Y axis condition

for ($i = 0; $i < $n – 1; $i++)

{

for ($j = 0; $j < 2; $j++)

{

if ($a[$i][0] != $a[$i + 1][0])

$x = false;

if ($a[$i][1] != $a[$i + 1][1])

$y = false;

}

}

// To display the output

if ($x)

echo "parallel to X Axis" ;

else if (y)

echo "parallel to Y Axis" ;

else

echo "Not parallel to X"

, " and Y Axis";

}

// Driver’s Code

$a = array(array(1, 2),

array(1, 4),

array(1, 6),

array(1, 0));

$n = count($a);

parallel($n, $a);

//This code is contributed by anuj_67

?>

[/sourcecode]

**Output:**

Parallel to X Axis

## Recommended Posts:

- Minimum number of points to be removed to get remaining points on one side of axis
- Find Four points such that they form a square whose sides are parallel to x and y axes
- Program to check if three points are collinear
- Program to check whether 4 points in a 3-D plane are Coplanar
- Check if the given 2-D points form T-shape or not
- How to check if given four points form a square
- Check whether four points make a parallelogram
- Check whether it is possible to join two points given on circle such that distance between them is k
- Check if two people starting from different points ever meet
- Program for distance between two points on earth
- Program to calculate distance between two points
- Program to calculate distance between two points in 3 D
- Program to find line passing through 2 Points
- Steps required to visit M points in order on a circular ring of N points
- Count of obtuse angles in a circle with 'k' equidistant points between 2 given points

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.