Check if a large number is divisible by 25 or not - GeeksforGeeks

15 Apr, 2021
Given a number, the task is to check if number is divisible by 25. The input number may be large and it may not be possible to store even if we use long long int.
Examples: 
Input  : n = 56945250
Output : Yes

Input  : n = 1234567589333100
Output : Yes

Input  : n = 3635883959606670431112222
Output : No
Since input number may be very large, we cannot use n % 25 to check if a number is divisible by 25 or not, especially in languages like C/C++. The idea is based on following fact.
A number is divisible by 25 if its digits 
last two digits will be 0  or divisible by 25 .
Illustration: 
For example, let us consider 769575 
Number formed by last two digits is = 75
Since 75 is divisible by 25 , answer is YES.
Let us consider 5325, we can write it as
5325 = 5*1000 + 3*100 + 2*10 + 5

The proof is based on below observation:
Remainder of 10i divided by 25 is 0 if i greater 
than or equal to two. Note than 100, 1000,
... etc lead to remainder 0 when divided by 25.

So remainder of " 5*1000 + 3*100 + 2*10 + 5" 
divided by 25 is equivalent to remainder 
of following : 
0 + 0 + 20 + 5 = 25

Since 25 is divisible by 25, answer is yes.
C++
Java
Python3
C#
PHP
Javascript
// C++ program to find if a number is// divisible by 25 or not#include<bits/stdc++.h>using namespace std; // Function to find that number divisible// by 25 or not.bool isDivisibleBy25(string str){    // If length of string is single digit then    // it's not divisible by 25    int n = str.length();    if (n == 1)        return false;     return ( (str[n-1]-'0' == 0  &&              str[n-2]-'0' == 0) ||   ((str[n-2]-'0')*10 + (str[n-1]-'0'))%25 == 0 );} // Driver codeint main(){    string str = "76955";    isDivisibleBy25(str)?  cout << "Yes" :                           cout << "No ";    return 0;}
// Java program to find if a number is// divisible by 25 or notclass IsDivisible{    // Function to find that number divisible    // by 25 or not.    static boolean isDivisibleBy25(String str)    {        // If length of string is single digit then        // it's not divisible by 25        int n = str.length();        if (n == 1)            return false;              return ( (str.charAt(n-1)-'0' == 0  &&                  str.charAt(n-2)-'0' == 0) ||        ((str.charAt(n-2)-'0')*10 + (str.charAt(n-1)-'0'))%25 == 0 );    }         // main function    public static void main (String[] args)    {        String str = "76955";        if(isDivisibleBy25(str))            System.out.println("Yes");        else            System.out.println("No");    }}
# Python 3 program to find if# a number is divisible by 25# or not # Function to find that# number divisible by 25 or not.def isDivisibleBy25(st) :     # If length of string is    # single digit then it's    # not divisible by 25    n = len(st)    if (n == 1) :        return False     return ((int)(st[n-1]) == 0 and ((int)(st[n-2])== 0) or           ((int)(st[n-2])*10 + (int)(st[n-1])%25 == 0)) # Driver codest = "76955"if(isDivisibleBy25(st)) :    print("Yes")else :    print("No")      # This code is contributed by Nikita Tiwari.
// C# program to find if a number// is divisible by 25 or notusing System; class IsDivisible{    // Function to find that number    // divisible by 25 or not.    static bool isDivisibleBy25(String str)    {        // If length of string is single digit then        // then it's not divisible by 25        int n = str.Length;        if (n == 1)            return false;             return ((str[n - 1] - '0' == 0 &&                 str[n - 2] - '0' == 0) ||                ((str[n - 2] - '0') * 10 +                 (str[n - 1] - '0')) % 25 == 0);    }         // Driver Code    public static void Main ()    {        String str = "76955";        if(isDivisibleBy25(str))            Console.Write("Yes");        else            Console.Write("No");    }} // This code is contributed by Nitin Mittal
<?php// PHP program to find if a number// is divisible by 25 or not // Function to find that number//  divisible by 25 or not.function isDivisibleBy25($str){         // If length of string    // is single digit then    // it's not divisible by 25    $n = strlen($str);    if ($n == 1)        return false;     return ( ($str[$n - 1] -'0' == 0 &&              $str[$n - 2] -'0' == 0) ||            (($str[$n - 2] -'0') * 10 +             ($str[$n - 1] - '0')) % 25 == 0 );} // Driver code$str = "76955";$x = isDivisibleBy25($str) ? "Yes" : "No ";echo($x); // This code is contributed by Ajit.?>
<script> // Javascript program to find if a number// is divisible by 25 or not   // Function to find that number// divisible by 25 or notfunction isDivisibleBy25(str){         // If length of string    // is single digit then    // it's not divisible by 25    n = str.length;         if (n == 1)        return false;       return ((str[n - 1] -'0' == 0 &&             str[n - 2] -'0' == 0) ||           ((str[n - 2] -'0') * 10 +            (str[n - 1] - '0')) % 25 == 0);}   // Driver Codevar str = "76955";var x = isDivisibleBy25(str) ? "Yes" : "No"; document.write (x); // This code is contributed by bunnyram19 </script>
Output: 
No
This article is contributed by DANISH_RAZA . 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. 
nitin mittal
jit_t
Akanksha_Rai
bunnyram19
divisibility
large-numbers
Mathematical
Mathematical
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Program to print prime numbers from 1 to N.
Segment Tree | Set 1 (Sum of given range)
Modular multiplicative inverse
Count all possible paths from top left to bottom right of a mXn matrix
Fizz Buzz Implementation
Check if a number is Palindrome
Program to multiply two matrices
Merge two sorted arrays with O(1) extra space
Generate all permutation of a set in Python
Count ways to reach the n'th stair