AND bit a bit de todos los elementos de la array

Dada una array , arr[] de N enteros, la tarea es encontrar el AND(&) bit a bit de todos los elementos de la array.

Ejemplos: 

Entrada: arr[] = {1, 3, 5, 9, 11} 
Salida: 1

Entrada: arr[] = {3, 7, 11, 19, 11} 
Salida:
 

Enfoque: La idea es atravesar todos los elementos de la array y calcular el AND bit a bit para todos los elementos e imprimir el resultado obtenido.

A continuación se muestra la implementación del enfoque anterior:  

C++14

// C++ program to find bitwise AND of all the elements in the array
#include <bits/stdc++.h>
using namespace std;
 
int find_and(int arr[], int len)
{
    // Initialise ans variable is arr[0]
    int ans = arr[0];
    // Traverse the array compute AND
    for (int i = 0; i < len; i++)
        ans = (ans & arr[i]);
    return ans;
}
 
// Driver function
int main()
{
    int arr[] = { 1, 3, 5, 9, 11 };
    int n = sizeof(arr) / sizeof(arr[0]);
    // Function Call to find AND
    cout << find_and(arr, n);
    return 0;
}
 
// This code is contributed by Aditya Kumar (adityakumar129)

C

// C program to find bitwise AND of all the elements in the array
#include <stdio.h>
 
int find_and(int arr[], int len)
{
    // Initialise ans variable is arr[0]
    int ans = arr[0];
    // Traverse the array compute AND
    for (int i = 0; i < len; i++)
        ans = (ans & arr[i]);
    return ans;
}
 
// Driver function
int main()
{
    int arr[] = { 1, 3, 5, 9, 11 };
    int n = sizeof(arr) / sizeof(arr[0]);
    // Function Call to find AND
    printf("%d",find_and(arr, n));
    return 0;
}
 
// This code is contributed by Aditya Kumar (adityakumar129)

Java

// Java program to find bitwise AND
// of all the elements in the array
import java.util.*;
class GFG {
    // Function to calculate bitwise AND
    static int find_and(int arr[])
    {
        // Initialise ans variable is arr[0]
        int ans = arr[0];
        // Traverse the array compute AND
        for (int i = 0; i < arr.length; i++)
            ans = (ans & arr[i]);
        return ans;
    }
    // Driver Code
    public static void main(String args[])
    {
        int arr[] = { 1, 3, 5, 9, 11 };
        // Function Call to find AND
        System.out.println(find_and(arr));
    }
}
 
// This code is contributed by Aditya Kumar (adityakumar129)

Python3

# Python program to find bitwise AND
# of all the elements in the array
 
# Function to calculate bitwise AND
def find_and(arr):
     
    # Initialise ans variable is arr[0]
    ans = arr[0]
     
    # Traverse the array compute AND
    for i in range(1, len(arr)):
        ans = ans&arr[i]
         
    # Return ans
    return ans
     
# Driver Code
if __name__ == '__main__':
    arr = [1, 3, 5, 9, 11]
     
    # Function Call to find AND
    print(find_and(arr))

C#

// C# program to find bitwise AND
// of all the elements in the array
using System;
class GFG{
// Function to calculate bitwise AND
    static int find_and(int[] arr){
         
        // Initialise ans variable is arr[0]
        int ans = arr[0];
         
        // Traverse the array compute AND
        for (int i=0;i<arr.Length;i++){
            ans = (ans&arr[i]);
        }
        // Return ans
        return ans;
    }
    // Driver Code
    public static void Main()
    {
        int[] arr = {1, 3, 5, 9, 11};
         
        // Function Call to find AND
        Console.Write(find_and(arr));
    }
}
 
// This code is contributed by AbhiThakur

Javascript

<script>
 
// Javascript program to find bitwise AND
// of all the elements in the array
 
// Function to calculate bitwise AND
function find_and(arr)
{
     
    // Initialise ans variable is arr[0]
    let ans = arr[0];
       
    // Traverse the array compute AND
    for(let i = 0; i < arr.length; i++)
    {
        ans = (ans&arr[i]);
    }
     
    // Return ans
    return ans;
}
 
// Driver Code
let arr = [ 1, 3, 5, 9, 11 ];
 
// Function Call to find AND
document.write(find_and(arr));
     
// This code is contributed by unknown2108
 
</script>
Producción: 

1

 

Publicación traducida automáticamente

Artículo escrito por mohit kumar 29 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA

Deja una respuesta

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *