Add solutions of problems under BigNumber sub-domain of Java domain

rajatgoyal715 · rajatgoyal715 · commit 4c8cdf025eb7 · 2018-08-02T17:45:43.000+05:30
diff --git a/Java/BigNumber/JavaBigDecimal.java b/Java/BigNumber/JavaBigDecimal.java
@@ -0,0 +1,25 @@
+import java.math.BigDecimal;
+import java.util.*;
+
+class JavaBigDecimal {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        String[] s = new String[n];
+
+        // input
+        for (int i = 0; i < n; i++)
+            s[i] = sc.next();
+        sc.close();
+
+        // lambda expressions
+        Arrays.sort(s, (as, bs) -> {
+            BigDecimal bd1 = new BigDecimal(bs);
+            return bd1.compareTo(new BigDecimal(as));
+        });
+
+        // output
+        for (int i = 0; i < n; i++)
+            System.out.println(s[i]);
+    }
+}
diff --git a/Java/BigNumber/JavaBigInteger.java b/Java/BigNumber/JavaBigInteger.java
@@ -0,0 +1,16 @@
+import java.util.Scanner;
+import java.math.BigInteger;
+
+public class JavaBigInteger {
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+        BigInteger a = sc.nextBigInteger();
+        BigInteger b = sc.nextBigInteger();
+        sc.close();
+        
+        BigInteger sum = a.add(b);
+        BigInteger mul = a.multiply(b);
+        System.out.println(sum);
+        System.out.println(mul);
+    }
+}
diff --git a/Java/BigNumber/JavaPrimalityTest.java b/Java/BigNumber/JavaPrimalityTest.java
@@ -0,0 +1,14 @@
+import java.io.*;
+import java.util.*;
+
+public class JavaPrimalityTest {
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        BigInteger n = in.nextBigInteger();
+        in.close();
+
+        // Write your code here.
+        System.out.println(n.isProbablePrime(1) ? "prime" : "not prime");
+    }
+}
