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

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...