Skip to main content

BIG Integer

Problem Statement
In this problem you have to add and multiply huge numbers! These numbers are so big that you can't contain them in any ordinary data types like long integer.
Use the power of Java's BigInteger class and solve this problem.
Input Format
There will be two lines containing two numbers, a and b. The numbers are non-negative and can have maximum 200 digits.
Output Format
Output two lines. The first line should contain a+b, and the second line should contain a×b. Don't print any leading zeros.
Sample Input
1234
20
Sample Output
1254
24680
Explanation
1234+20=1254
1234*20=24680



import java.io.*;
import java.util.*;
import java.math.*;

public class Solution {
    static BigDecimal add(BigDecimal a,BigDecimal b){return a.add(b);}
                static BigDecimal multiply(BigDecimal a,BigDecimal b){return a.multiply(b);          }
    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner scan=new Scanner(System.in);
        String str1=scan.next();
        String str2=scan.next();
        System.out.println(add(new BigDecimal(str1),new BigDecimal(str2)));
        System.out.println(multiply(new BigDecimal(str1),new BigDecimal(str2)));
    }
}

Input
Str1=”12312312312312";
str2="2342342342342342";
Output:
2354654654654654
28839650461271347136325514704


 Score: 10.00
Test Case #0:  0.08s
Test Case #1:  0.08s
Test Case #2:  0.09s
Test Case #3:  0.08s
Test Case #4:  0.09s
Test Case #5:  0.08s
Test Case #6:  0.08s
Test Case #7:  0.08s
Test Case #8:  0.09s


Comments

Post a Comment

Popular posts from this blog

CODILITY: Determine whether given string of parentheses is properly nested.

Task description A string S consisting of N characters is called  properly nested  if: S is empty; S has the form " (U) " where U is a properly nested string; S has the form " VW " where V and W are properly nested strings. For example, string " (()(())()) " is properly nested but string " ()) " isn't. Write a function: class Solution { public int solution(String S); } that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise. For example, given S = " (()(())()) ", the function should return 1 and given S = " ()) ", the function should return 0, as explained above. Assume that: N is an integer within the range [ 0 .. 1,000,000 ]; string S consists only of the characters " ( " and/or " ) ". Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(1) (not counting the storage requi...
1 comment
Read more

Distinct: Compute number of distinct values in an array.

Task description Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns the number of distinct values in array A. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −1,000,000 .. 1,000,000 ]. For example, given array A consisting of six elements such that: A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1 the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3. Complexity: expected worst-case time complexity is O(N*log(N)); expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified. class Solution { public int solution ( int [] A) { // write your code in Java SE 8 int len=A.length; int count= 1 ; ...
1 comment
Read more

Dominator: Find an index of an array such that its value occurs at more than half of indices in the array.

Dominator Find an index of an array such that its value occurs at more than half of indices in the array. Task description A zero-indexed array A consisting of N integers is given. The dominator  of array A is the value that occurs in more than half of the elements of A. For example, consider array A such that A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3 The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8. Write a function class Solution { public int solution(int[] A); } that, given a zero-indexed array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator. Assume that: N is an integer within the range [ 0 .. 100,000 ]; each element of array A is an integer within the range [ −2,147,483,648 .. 2,147,483...
Post a Comment
Read more