Skip to content
Related Articles

Related Articles

Improve Article
Check whether sum of digits at odd places of a number is divisible by K
  • Last Updated : 31 May, 2021

Given two integers ‘N’ and ‘K’, the task is to find the sum of digits of ‘N’ at its odd places (right to left) and check whether the sum is divisible by ‘K’. If it is divisible, output YES, otherwise output NO.

Examples: 

Input: N = 4325, K = 4 
Output: YES 
Since, 3 + 5 = 8, which is divisible by 4.

Input: N = 1209, K = 3 
Output: NO  

Approach:  



  • Find the sum of the digits of ‘N’ at odd places (right to left).
  • Then check the divisibility of the sum by taking its modulo with ‘K’.
  • If it is divisible, then output ‘YES’, otherwise output ‘NO’.

Below is the implementation of the above approach: 

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// function that checks the
// divisibility of the sum
// of the digits at odd places
// of the given number
bool SumDivisible(int n, int k)
{
    int sum = 0, position = 1;
    while (n > 0) {
 
        // if position is odd
        if (position % 2 == 1)
            sum += n % 10;
        n = n / 10;
        position++;
    }
 
    if (sum % k == 0)
        return true;
    return false;
}
 
// Driver code
int main()
{
    int n = 592452;
    int k = 3;
 
    if (SumDivisible(n, k))
        cout << "YES";
    else
        cout << "NO";
    return 0;
}
Java



// Java implementation of the approach
import java.util.*;
 
class solution
{
 
// function that checks the
// divisibility of the sum
// of the digits at odd places
// of the given number
static boolean SumDivisible(int n, int k)
{
    int sum = 0, position = 1;
    while (n > 0) {
 
        // if position is odd
        if (position % 2 == 1)
            sum += n % 10;
        n = n / 10;
        position++;
    }
 
    if (sum % k == 0)
        return true;
    return false;
}
 
// Driver code
public static void main(String arr[])
{
    int n = 592452;
    int k = 3;
 
    if (SumDivisible(n, k))
        System.out.println("YES");
    else
        System.out.println("NO");
 
}
}
//This code is contributed by Surendra_Gangwar
Python 3



# Python 3 implementation of the approach
 
# function that checks the divisibility
# of the sum of the digits at odd places
# of the given number
def SumDivisible(n, k):
 
    sum = 0
    position = 1
    while (n > 0) :
 
        # if position is odd
        if (position % 2 == 1):
            sum += n % 10
        n = n // 10
        position += 1
     
    if (sum % k == 0):
        return True
    return False
 
# Driver code
if __name__ =="__main__":
    n = 592452
    k = 3
 
    if (SumDivisible(n, k)):
        print("YES")
    else:
        print("NO")
 
# This code is contributed
# by ChitraNayal
C#



// C# implementation of the approach
using System;
 
class GFG
{
// function that checks the
// divisibility of the sum
// of the digits at odd places
// of the given number
static bool SumDivisible(int n, int k)
{
    int sum = 0, position = 1;
    while (n > 0)
    {
 
        // if position is odd
        if (position % 2 == 1)
            sum += n % 10;
        n = n / 10;
        position++;
    }
 
    if (sum % k == 0)
        return true;
    return false;
}
 
// Driver code
static public void Main ()
{
    int n = 592452;
    int k = 3;
 
    if (SumDivisible(n, k))
        Console.WriteLine("YES");
    else
        Console.WriteLine("NO");
}
}
 
// This code is contributed by Sachin
PHP



<?php
// PHP implementation of the approach
 
// function that checks the divisibility
// of the sum of the digits at odd places
// of the given number
function SumDivisible($n, $k)
{
    $sum = 0;
    $position = 1;
    while ($n > 0)
    {
 
        // if position is odd
        if ($position % 2 == 1)
            $sum += $n % 10;
        $n = (int)$n / 10;
        $position++;
    }
 
    if ($sum % $k == 0)
        return true;
    return false;
}
 
// Driver code
$n = 592452;
$k = 3;
 
if (SumDivisible($n, $k))
    echo "YES";
else
    echo "NO";
 
// This code is contributed
// by Sach_Code
?>
Javascript



<script>
 
// JavaScript implementation of the approach
 
// function that checks the
// divisibility of the sum
// of the digits at odd places
// of the given number
function SumDivisible(n, k)
{
    let sum = 0, position = 1;
    while (n > 0) {
 
        // if position is odd
        if (position % 2 == 1)
            sum += n % 10;
        n = Math.floor(n / 10);
        position++;
    }
 
    if (sum % k == 0)
        return true;
    return false;
}
 
// Driver code
 
    let n = 592452;
    let k = 3;
 
    if (SumDivisible(n, k))
        document.write("YES");
    else
        document.write("NO");
 
 
// This code is contributed by Surbhi Tyagi.
 
</script>
Output: 
YES
 
Method #2:Using string() method:
  1. Convert the integer to a string, then traverse the string and find the sum of all odd indices by storing it in sum.
  2. If the sum is divisible by k, then return True else False.
Below is the implementation:
Python3



# Python3 implementation of the
# above approach
 
def sumDivisible(n, k):
    sum = 0
     
    # Converting integer to string
    num = str(n)
     
    # Traversing the string
    for i in range(len(num)):
        if(i % 2 != 0):
            sum = sum+int(num[i])
 
    if sum % k == 0:
        return True
    return False
 
 
# Driver code
n = 592452
k = 3
if sumDivisible(n, k) == True:
    print("YES")
else:
    print("NO")
 
# This code is contributed by vikkycirus
Javascript



<script>
 
// javascript implementation of the
// above approach
 
function sumDivisible(n, k){
    var sum = 0
     
    // Converting integer to string
    var num = n.toString()
     
    // Traversing the string
    for(var i=0 ; i < num.length ; i++) {
        if(i % 2 != 0) {
            sum = sum + Number(num[i])
        }
    }
 
    if (sum % k == 0){
        return true;
    }
    else{
    return false;
    }
}
 
// Driver code
var n = 592452
var k = 3
if(sumDivisible(n, k)){
    document.write("YES");
}
else{
    document.write("NO");
}
 
 
 
 
 
</script>
Output:
Yes
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.



My Personal Notes
arrow_drop_up
Next

Program to print GP (Geometric Progression)
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
Check whether product of digits at even places of a number is divisible by K
14, Nov 18
Check if product of digits of a number at even and odd places is equal
27, Feb 19
Check if the sum of digits of number is divisible by all of its digits
12, Sep 19
Count numbers from given range having odd digits at odd places and even digits at even places
02, Dec 20
Program to check if a number is divisible by any of its digits
17, Jan 19
Check if N is divisible by a number which is composed of the digits from the set {A, B}
28, Nov 18
Program to check if a number is divisible by sum of its digits
21, Jan 19
Check if the number formed by the last digits of N numbers is divisible by 10 or not
26, Sep 19
Given a large number, check if a subsequence of digits is divisible by 8
13, Nov 17
Check if all prefixes of a number is divisible by remaining count of digits
17, Jun 21
Find the sum of digits of a number at even and odd places
10, Apr 19
Primality test for the sum of digits at odd places of a number
12, Nov 18
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 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
Minimum and maximum number of digits required to be removed to make a given number divisible by 3
02, Dec 20
Minimum number of digits required to be removed to make a number divisible by 4
19, Feb 21
Check if sum of digits of a number exceeds the product of digits of that number
13, May 21
Kth number exceeding N whose sum of its digits divisible by M
27, Oct 20
Smallest number not less than N which is divisible by all digits of N
07, Jan 21
Largest number with the given set of N digits that is divisible by 2, 3 and 5
26, Oct 18
Find N digits number which is divisible by D
24, Oct 18
Smallest number with sum of digits as N and divisible by 10^N
10, Jan 18
Number of digits to be removed to make a number divisible by 3
08, Nov 17
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