检查给定的整数a、b、c、d是否成比例

// C++ implementation of the approach
#include
using namespace std;
// Function that returns true if the
// given four integers are in proportion
bool inProportion(int arr[])
{
    // Array will consist of
    // only four integers
    int n = 4;
    // Sort the array
    sort(arr, arr + n);
    // Find the product of extremes and means
    long extremes = (long)arr[0] * (long)arr[3];
    long means = (long)arr[1] * (long)arr[2];
    // If the products are equal
    if (extremes == means)
        return true;
    return false;
}
// Driver code
int main()
{
    int arr[] = { 1, 2, 4, 2 };
    if (inProportion(arr))
        cout << "Yes";
    else
        cout << "No";
    return 0;
}


// Java implementation of the approach
import java.util.*;
class GFG
{
// Function that returns true if the
// given four integers are in proportion
static boolean inProportion(int []arr)
{
    // Array will consist of
    // only four integers
    int n = 4;
    // Sort the array
    Arrays.sort(arr);
    // Find the product of extremes and means
    long extremes = (long)arr[0] * (long)arr[3];
    long means = (long)arr[1] * (long)arr[2];
    // If the products are equal
    if (extremes == means)
        return true;
    return false;
}
// Driver code
public static void main(String args[])
{
    int arr[] = { 1, 2, 4, 2 };
    if (inProportion(arr))
        System.out.println("Yes");
    else
        System.out.println("No");
}
}
// This code is contributed by Rajput-Ji


# Python3 implementation of the approach
# Function that returns true if the
# given four integers are in proportion
def inProportion(arr) :
    # Array will consist of
    # only four integers
    n = 4;
    # Sort the array
    arr.sort()
    # Find the product of extremes and means
    extremes = arr[0] * arr[3];
    means = arr[1] * arr[2];
    # If the products are equal
    if (extremes == means) :
        return True;
    return False;
# Driver code
if __name__ == "__main__" :
    arr = [ 1, 2, 4, 2 ];
    if (inProportion(arr)) :
        print("Yes");
    else :
        print("No");
# This code is contributed by AnkitRai01


// C# implementation of the approach
using System;
class GFG
{
// Function that returns true if the
// given four integers are in proportion
static bool inProportion(int []arr)
{
    // Array will consist of
    // only four integers
    int n = 4;
    // Sort the array
    Array.Sort(arr);
    // Find the product of extremes and means
    long extremes = (long)arr[0] * (long)arr[3];
    long means = (long)arr[1] * (long)arr[2];
    // If the products are equal
    if (extremes == means)
        return true;
    return false;
}
// Driver code
public static void Main(String []args)
{
    int []arr = { 1, 2, 4, 2 };
    if (inProportion(arr))
        Console.WriteLine("Yes");
    else
        Console.WriteLine("No");
}
}
// This code is contributed by Princi Singh


Yes