Skip to main content

How to Divide and compute Modulo of large number | How to compute mod of a big number?

Print modulo of BigInteger in Java | Convert large String to BigInteger in Java

print modulo of large number in java | BigInteger in java

Sometimes, as developer we need to divide large number that is represented as String. For divide and get modulo we require value as number (int, long or float). But int, long have some limitations.

So we can use BigInteger class for storing large numbers.

BigInteger class is used for the mathematical operation which involves very big integer calculations that are outside the limit of all available primitive data types.

Example : Check Odd and Even for large number using BigInteger class

public class BigIntegerDemo {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter large number");
        BigInteger number = sc.nextBigInteger();

        // Getting modulo of entered number
        BigInteger ans = number.mod(new BigInteger("2"));

        // Check modulo is 0 or not and print based on that
        if (ans.equals(new BigInteger("0"))) {
            System.out.println(number +" is Even number");
        } else {
            System.out.println(number +" is Odd number");
        }
    }
}

Output :

Enter large number
123456789123456789
123456789123456789 is Odd number

Enter large number
98765432112345678901234567890
98765432112345678901234567890 is Even number

 

Other Java articles :

Merging two sorted Linked List using Recursion approach with Stack trace

Reverse a String Recursively in Java with Explanation 

Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static jav...

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...