Programa para comprobar si los puntos son paralelos al eje X o al eje Y

Dados n puntos, debemos verificar si estos n puntos son paralelos al eje X o al eje Y o a Sin eje.

Ejemplos:  

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

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

Acercarse

Para encontrar los puntos paralelos al eje X o Y, simplemente verifique si los puntos son iguales para cualquier eje o no. Si todos los puntos en el eje X son iguales, entonces la línea es paralela al eje Y. Si todos los puntos en el eje Y son iguales, entonces la línea es paralela al eje X. Si ninguno de los casos es verdadero, entonces no es paralelo a ningún eje. 
Ingrese el valor N. Y luego Ingrese el valor de los puntos en un 
 

// 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++) {
        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 Y Axis" << endl;
    else if (y)
        cout << "parallel to X 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;
}

// 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++) {
            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 Y Axis");
        else if (y)
            System.out.println("Parallel to X 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);
    }
}

# Python3 program to check for parallel
# to X and Y Axis
 
# To check for parallel line
def parallel(n, a):
    x = True;
    y = True;
 
    # checking for parallel
    # to X and Y axis condition
    for i in range(n - 1):
            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):
        print("Parallel to Y Axis");
    elif (y):
        print("Parallel to X Axis");
    else:
        print("Not Parallel to X and Y Axis");
 
# Driver's Code
a = [[1, 2], [1, 4],
     [1, 6], [1, 0]];
 
n = len(a);
parallel(n, a);
 
# This code is contributed by mits

// C# program to illustrate..
// To check for parallel
// To X and Y Axis
 
class GFG {
 
    // To check for parallel line
    static void parallel(int[, ] a)
    {
        bool x = true, y = true;
 
        // checking for parallel to X and Y
        // axis condition
        for (int i = 0; i < a.Rank - 1; i++) {
            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.Console.WriteLine("Parallel to Y Axis");
        else if (y)
            System.Console.WriteLine("Parallel to X Axis");
        else
            System.Console.WriteLine("Not parallel to X"
                                     + " and Y axis");
    }
 
    public static void Main()
    {
        int[, ] a = { { 1, 2 },
                      { 1, 4 },
                      { 1, 6 },
                      { 1, 0 } };
        parallel(a);
    }
}
// This code is contributed by mits

<?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++)
    {
            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 Y Axis" ;
    else if (y)
        echo "parallel to X 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
?>

<script>
 
// Javascript program to check for parallel
// to X and Y Axis
 
// To check for parallel line
function parallel(n, a)
{
    let x = true, y = true;
     
    // Checking for parallel to X and Y
    // axis condition
    for(let i = 0; i < n - 1; i++)
    {
        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)
        document.write("parallel to Y Axis" + "</br>");
    else if (y)
        document.write("parallel to X Axis" + "</br>");
    else
        document.write("Not parallel to X" +
                       " and Y Axis" + "</br>");
}
 
// Driver code
let a = [ [ 1, 2 ],
          [ 1, 4 ],
          [ 1, 6 ],
          [ 1, 0 ] ];
let n = a.length;
 
parallel(n, a);
 
// This code is contributed by jana_sayantan
     
</script>

Parallel to Y Axis

Complejidad de tiempo: O(n)

Espacio Auxiliar: O(1)