Skip to content
Related Articles

Related Articles

Improve Article

Check whether product of digits at even places of a number is divisible by K

  • Last Updated : 28 May, 2021

Given a number N, the task is to check whether the product of digits at even places of a number is divisible by K. If it is divisible, output “YES” otherwise output “NO”. 
Examples: 

Input: N = 5478, K = 5
Output: YES
Since, 5 * 7 = 35, which is divisible by 5

Input: N = 19270, K = 2
Output: NO

Approach:  

Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

  1. Find product of digits at even places from right to left.
  2. Then check the divisibility by taking its modulo with ‘K’
  3. If modulo gives 0, output YES, otherwise output NO

Below is the implementation of the above approach:  

C++




// C++ implementation of the above approach
#include <bits/stdc++.h>
using namespace std;
 
// below function checks whether
// product of digits at even places
// is divisible by K
bool productDivisible(int n, int k)
{
    int product = 1, position = 1;
    while (n > 0) {
 
        // if position is even
        if (position % 2 == 0)
            product *= n % 10;
        n = n / 10;
        position++;
    }
 
    if (product % k == 0)
        return true;
    return false;
}
 
// Driver code
int main()
{
    int n = 321922;
    int k = 3;
 
    if (productDivisible(n, k))
        cout << "YES";
    else
        cout << "NO";
 
    return 0;
}
Java



// JAVA implementation of the above approach
class GFG {
// below function checks whether
// product of digits at even places
// is divisible by K
 
    static boolean productDivisible(int n, int k) {
        int product = 1, position = 1;
        while (n > 0) {
 
            // if position is even
            if (position % 2 == 0) {
                product *= n % 10;
            }
            n = n / 10;
            position++;
        }
 
        if (product % k == 0) {
            return true;
        }
        return false;
    }
 
// Driver code
    public static void main(String[] args) {
        int n = 321922;
        int k = 3;
 
        if (productDivisible(n, k)) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }
    }
}
Python3



# Python3 implementation of the
# above approach
 
# below function checks whether
# product of digits at even places
# is divisible by K
def productDivisible(n, k):
    product = 1
    position = 1
    while n > 0:
         
        # if position is even
        if position % 2 == 0:
            product *= n % 10
        n = n / 10
        position += 1
    if product % k == 0:
        return True
    return False
 
# Driver code
n = 321922
k = 3
if productDivisible(n, k) == True:
    print("YES")
else:
    print("NO")
 
# This code is contributed
# by Shrikant13
C#



// C# implementation of the above approach
using System;
 
class GFG
{
// below function checks whether
// product of digits at even places
// is divisible by K
static bool productDivisible(int n, int k)
{
    int product = 1, position = 1;
    while (n > 0)
    {
 
        // if position is even
        if (position % 2 == 0)
            product *= n % 10;
        n = n / 10;
        position++;
    }
 
    if (product % k == 0)
        return true;
    return false;
}
 
// Driver code
public static void Main()
{
    int n = 321922;
    int k = 3;
 
    if (productDivisible(n, k))
        Console.WriteLine("YES");
    else
        Console.WriteLine("NO");
}
}
 
// This code is contributed
// by Akanksha Rai(Abby_akku)
PHP



<?php
// PHP implementation of the
// above approach
 
// Below function checks whether
// product of digits at even places
// is divisible by K
function productDivisible($n, $k)
{
    $product = 1;
    $position = 1;
    while ($n > 0)
    {
 
        // if position is even
        if ($position % 2 == 0)
            $product *= $n % 10;
        $n = (int)($n / 10);
        $position++;
    }
 
    if ($product % $k == 0)
        return true;
    return false;
}
 
// Driver code
$n = 321922;
$k = 3;
 
if (productDivisible($n, $k))
    echo "YES";
else
    echo "NO";
 
// This code is contributed by mits
?>
Javascript



<script>
 
// Javascript implementation of the above approach
 
// below function checks whether
// product of digits at even places
// is divisible by K
function productDivisible(n, k)
{
    var product = 1, position = 1;
    while (n > 0) {
 
        // if position is even
        if (position % 2 == 0)
            product *= n % 10;
        n =parseInt(n / 10);
        position++;
    }
 
    if (product % k == 0)
        return true;
    return false;
}
 
// Driver code
var n = 321922;
var k = 3;
if (productDivisible(n, k))
    document.write( "YES");
else
    document.write( "NO");
 
</script>
Output: 
YES
 
Method #2:Using string() method:
  1. Convert the integer to string then traverse the string and Multiply all even indices by storing it in the product.
  2. If the product is divisible by k then return True else False.
Below is the implementation:
Python3



# Python3 implementation of the
# above approach
 
# Function checks whether
# product of digits at even places
# is divisible by K
def productDivisible(n, k):
    product = 1
     
    # Converting integer to string
    num = str(n)
     
    # Traversing the string
    for i in range(len(num)):
        if(i % 2 == 0):
            product = product*int(num[i])
 
    if product % k == 0:
        return True
    return False
 
 
# Driver code
n = 321922
k = 3
if productDivisible(n, k) == True:
    print("YES")
else:
    print("NO")
 
# This code is contributed by vikkycirus
Javascript



<script>
 
// JavaScript implementation of the
// above approach
  
// Function checks whether
// product of digits at even places
// is divisible by K
function productDivisible(n, k){
    var product = 1 ;
      
    // Converting integer to string
    var num = n.toString()
      
    // Traversing the string
    for(let i = 0 ; i < num.length ; i++){
        if(i % 2 == 0){
            product = product * Number(num[i])
        }
    }
    if (product % k == 0){
        return true
    }
    else{
    return false;
    }
}
  
  
// Driver code
var n = 321922
var k = 3
if(productDivisible(n, k)){
    document.write("YES")
}
else{
    document.write("NO")
}
 
 
</script>
Output:
YES



My Personal Notes
arrow_drop_up
Next

Check whether sum of digits at odd places of a number is divisible by K
Recommended Articles
Page :
Check whether product of digits at even places is divisible by sum of digits at odd place of a number
19, Nov 18
Count numbers from given range having odd digits at odd places and even digits at even places
02, Dec 20
Check whether sum of digits at odd places of a number is divisible by K
13, Nov 18
Check if product of digits of a number at even and odd places is equal
27, Feb 19
Find the sum of digits of a number at even and odd places
10, Apr 19
Count of integers in a range which have even number of odd digits and odd number of even digits
21, Aug 19
Check if sum of digits of a number exceeds the product of digits of that number
13, May 21
Count N-digits numbers made up of even and prime digits at odd and even positions respectively
29, Jul 21
Primality test for the sum of digits at odd places of a number
12, Nov 18
Check if the sum of digits of number is divisible by all of its digits
12, Sep 19
Count of numbers in range which are divisible by M and have digit D at odd places
10, Apr 20
Check whether product of 'n' numbers is even or odd
28, Oct 18
Check if sum of digits in the left half is divisible by sum of digits in the right half in the largest permutation of N
15, Jun 21
Number formed by deleting digits such that sum of the digits becomes even and the number odd
26, Feb 20
Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
13, Feb 19
Check whether a large number is divisible by 53 or not
22, May 20
To check whether a large number is divisible by 7
01, Oct 17
Count of all even numbers in the range [L, R] whose sum of digits is divisible by 3
26, Feb 19
Count of N-digit Numbers having Sum of even and odd positioned digits divisible by given numbers
07, Aug 20
Check if a number with even number of digits is palindrome or not
24, Sep 18
Find the array element from indices not divisible by K having largest composite product of digits
03, Jan 21
Check whether a given number is even or odd
11, Oct 16
Check whether given floating point number is even or odd
19, Dec 17
Check whether count of odd and even factors of a number are equal
03, Jul 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Shashank_Sharma
@Shashank_Sharma
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox