Bignumber problem can be solved easily using BigInteger class in java.Here is a sample for doing this….
\n[code]
\nimport java.math.BigInteger;<\/p>\n

public class BIG
\n{
\npublic static void main(String[] args)
\n{
\n\/\/initialization
\nBigInteger N1 = new BigInteger ("1000000000000000000");
\nBigInteger N2 = new BigInteger ("123456789123");
\nBigInteger N3 = new BigInteger ("50000000000");
\n\/\/Math operations
\nBigInteger mult = N1.multiply(N2); \/\/This is how to send arguments in bigint functions
\nBigInteger add = N1.add(N2);
\nBigInteger div= N1.divide(N2);
\nBigInteger substract1 = N1.subtract(N2); \/\/N1-N2
\nBigInteger substract2 = N2.subtract(N1); \/\/N2-N1
\nBigInteger gcd = N1.gcd(N3);
\n\/\/Printing output
\nSystem.out.println("Mult " + mult);
\nSystem.out.println("add " + add);
\nSystem.out.println("div " + div);
\nSystem.out.println("substract1 " + substract1);
\nSystem.out.println("substract2 " + substract2);
\nSystem.out.println("gcd N1 N3 " + gcd);
\n}
\n}
\n[\/code]
\nThere are some more built in functions:<\/p>\n

BigInteger.ONE; (==1)
\nBigInteger.ZERO;(==0)
\nA.abs();
\nA.add(N);
\nA.divide(N);
\nA.divideAndRemainder(N); (returns an array)
\nA.max(N);
\nA.min(N);
\nA.mod(N);
\nA.multiply(N);
\nA.remainder(N);
\nA.signum(N);<\/p>\n

A.doubleValue();
\nA.floatValue();
\nA.intValue();
\nA.longValue();
\nA.toString();
\nA.compareTo(N)<\/p>\n

converting an integer to bigint
\nBigInteger A = BigInteger.valueOf(20000);
\nYou can take input using scanner just as you input int,long etc.<\/p>\n","protected":false},"excerpt":{"rendered":"

Bignumber problem can be solved easily using BigInteger class in java.Here is a sample for doing this…. [code] import java.math.BigInteger; public class BIG { public static void main(String[] args) { \/\/initialization BigInteger N1 = new BigInteger ("1000000000000000000"); BigInteger N2 = new BigInteger ("123456789123"); BigInteger N3 = new BigInteger ("50000000000"); \/\/Math operations BigInteger mult = N1.multiply(N2); … <\/p>\n

Continue reading “Big Number problem in JAVA in programming contest”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0},"categories":[9],"tags":[],"_links":{"self":[{"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=\/wp\/v2\/posts\/7"}],"collection":[{"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=7"}],"version-history":[{"count":0,"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=\/wp\/v2\/posts\/7\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.ujjal.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}