计算一个数组中可以表示为两个完美正方形之差的元素

// C++ implementation to count the
// number of elements which can be
// represented as the difference
// of the two square
#include <bits/stdc++.h>
using namespace std;
// Function to count of such elements
// in the array which can be represented
// as the difference of the two squares
int count_num(int arr[], int n)
{
    // Initialize count
    int count = 0;
    // Loop to iterate
    // over the array
    for (int i = 0; i < n; i++)
        // Condition to check if the
        // number can be represented
        // as the difference of squares
        if ((arr[i] % 4) != 2)
            count++;
    cout << count;
    return 0;
}
// Driver code
int main()
{
    int arr[] = { 1, 2, 3 };
    int n = sizeof(arr) / sizeof(arr[0]);
    count_num(arr, n);
    return 0;
}


// Java implementation to count the
// number of elements which can be
// represented as the difference
// of the two square
class GFG{
// Function to count of such elements
// in the array which can be represented
// as the difference of the two squares
static void count_num(int []arr, int n)
{
    // Initialize count
    int count = 0;
    // Loop to iterate
    // over the array
    for(int i = 0; i < n; i++)
    {
       // Condition to check if the
       // number can be represented
       // as the difference of squares
       if ((arr[i] % 4) != 2)
           count++;
    }
    System.out.println(count);
}
// Driver code
public static void main (String[] args)
{
    int arr[] = { 1, 2, 3 };
    int n = arr.length;
    count_num(arr, n);
}
}
// This code is contributed by AnkitRai01


# Python3 implementation to count the
# number of elements in the array
# which can be represented as difference
# of the two elements
# Function to return the
# Count of required count
# of such elements
def count_num(arr, n):
    # Initialize count
    count = 0
    # Loop to iterate over the
    # array of elements
    for i in arr:
        # Condition to check if the
        # number can be represented
        # as the difference
        # of two squares
        if ((i % 4) != 2):
            count = count + 1
    return count
# Driver Code
if __name__ == "__main__":
    arr = [1, 2, 3]
    n = len(arr)
    # Function Call
    print(count_num(arr, n))


// C# implementation to count the
// number of elements which can be
// represented as the difference
// of the two square
using System;
class GFG{
// Function to count of such elements
// in the array which can be represented
// as the difference of the two squares
static void count_num(int []arr, int n)
{
    // Initialize count
    int count = 0;
    // Loop to iterate
    // over the array
    for(int i = 0; i < n; i++)
    {
        // Condition to check if the
        // number can be represented
        // as the difference of squares
        if ((arr[i] % 4) != 2)
            count++;
    }
    Console.WriteLine(count);
}
// Driver code
public static void Main(string[] args)
{
    int []arr = { 1, 2, 3 };
    int n = arr.Length;
    count_num(arr, n);
}
}
// This code is contributed by shivanisinghss2110


<script>
    // Javascript implementation to count the
    // number of elements which can be
    // represented as the difference
    // of the two square
    // Function to count of such elements
    // in the array which can be represented
    // as the difference of the two squares
    function count_num(arr, n)
    {
        // Initialize count
        let count = 0;
        // Loop to iterate
        // over the array
        for (let i = 0; i < n; i++)
            // Condition to check if the
            // number can be represented
            // as the difference of squares
            if ((arr[i] % 4) != 2)
                count++;
        document.write(count);
        return 0;
    }
    let arr = [ 1, 2, 3 ];
    let n = arr.length;
    count_num(arr, n);
script>


2