Find if a number is divisible by every number in a list

Given a list and a number task is to find the number which is divided by every element of the list.
Examples :

Input : List   = [1, 2, 3, 4, 5]
        Number = 3
Output : No

Input : List   = [4, 8, 12, 16, 20]
        Number = 4
Output : Yes

Algorithm:

1. Run a loop till length of the list
2. Divide every element with the given number
3. If number is not divided by any element, 
   return 0.
4. Return 1.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program which check is a number
// divided with every element in list or not
#include <bits/stdc++.h>
using namespace std;
  
// Function which check is a number
// divided with every element in list or not
bool findNoIsDivisibleOrNot(int a[], int n, int l)
{
    for (int i = 0; i < l; i++) {
        if (a[i] % n != 0)
            return false;
    }
    return true;
}
  
// driver program
int main()
{
    int a[] = {14, 12, 4, 18};
    int n = 2;
    int l = (sizeof(a) / sizeof(a[0]));
    if (findNoIsDivisibleOrNot(a, n, l))
        cout << "Yes";
    else
        cout << "No";
  
    return 0;
}
  
// This code is contributed by Sam007

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program which check is a number
// divided with every element in list
// or not
  
class GFG {
  
    // Function which check is a number
    // divided with every element in list or not
    static boolean findNoIsDivisibleOrNot(int a[], int n)
    {
        for (int i = 0; i < a.length; i++) {
            if (a[i] % n != 0)
                return false;
        }
        return true;
    }
  
    // driver program
    public static void main(String[] args)
    {
        int a[] = {14, 12, 4, 18};
        int n = 2;
        if (findNoIsDivisibleOrNot(a, n))
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}
  
// This code is contributed by Pramod Kumar

chevron_right


Python

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python program which check is a number
# divided with every element in list
# or not
def findNoIsDivisibleOrNot(n, l =[]):
  
    # Checking if a number is divided
    # by every element or not
    for i in range(0, len(l)):
        if l[i]% n != 0:
            return 0
    return 1
  
# Driver code
l = [14, 12, 4, 18]
n = 2
if findNoIsDivisibleOrNot(n, l) == 1:
    print "Yes"
else:
    print "No"

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program which check is a number
// divided with every element in list or no
using System;
  
class GFG {
  
    // Function which check is a number
    // divided with every element in list or not
    static bool findNoIsDivisibleOrNot(int[] a, int n)
    {
        for (int i = 0; i < a.Length; i++) {
            if (a[i] % n != 0)
                return false;
        }
        return true;
    }
  
    // driver program
    public static void Main()
    {
        int[] a = {14, 12, 4, 18};
        int n = 2;
        if (findNoIsDivisibleOrNot(a, n))
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
}
  
// This code is contributed by Sam007

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program which 
// check is a number
// divided with every
// element in list or not
  
// Function which check
// is a number divided 
// with every element 
// in list or not
function findNoIsDivisibleOrNot($a, $n, $l)
{
    for ($i = 0; $i < $l; $i++)
    {
        if ($a[$i] % $n != 0)
            return false;
    }
    return true;
}
  
    // Driver Code
    $a = array(14, 12, 4, 18);
    $n = 2;
    $l = sizeof($a);
    if (findNoIsDivisibleOrNot($a, $n, $l))
        echo "Yes";
    else
        echo "No";
  
// This code is contributed by ajit
?>

chevron_right


Output:



Yes

This article is contributed by Sahil Rajput. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up

Improved By : Sam007, jit_t



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.