This seems to work: BigInteger a = new(5678); BigInteger b = new(1234); BigInteger div = BigInteger.DivRem(a, b, out BigInteger rem); var decimalDigits = new List<BigInteger>(); while (rem != 0 && decimalDigits.Count < 10) { rem *= 10; decimalDigits.Add(BigInteger.DivRem(rem, b, out rem)); } Console.WriteLine($”{div}.{string.Concat(decimalDigits)}”); This is pretty much just an implementation of long division. 1 solved … Read more
See the doc, it should be used this way: public BigInteger mod(BigInteger m) public BigInteger divide(BigInteger val) You can change it to this: factorialans.mod(BigInteger.valueOf(10)) and factorialans.divide(BigInteger.TEN) solved counting the zeros in the the factorial number, please the check the error
you are passing reference to orig. you should use ‘orig.bigIntVector’ BigInt::BigInt(BigInt const& orig) : isPositive(orig.isPositive) , base(orig.base) , skip(orig.skip) { this->bigIntVector = new BigIntVector(*(orig.bigIntVector)); } should use *(orig.bigIntVector) 10 solved Copy Constructor Issue C++: “0xC0000005: Access violation writing location 0x00000000.”
For those with a maths background it is a surprising feature that System.out.println(“=” + (-3 % 4)); for example, returns -3 instead of 1 (which would be in the range [0,3]); Edit: in other words, the error message error message: Exception in thread “main” java.lang.ArrayIndexOutOfBoundsException: -8 is ultimately caused by (n % m) can return … Read more
You didn’t say exactly what errors you were getting, but you added some in-line comments. It’s best to post the exact error message separately from the code (and also indicate which line it came from, and what you expected that line to do). Looking at this one: if (a.leftLeft == b.leftLeft = 0){ there is … Read more
So you have power of 2 operations which can be easily converted to bit operations… no bigint lib is needed for such triviality. Let assume you got number const int n=1000000000; // number size in bytes BYTE x[n]; // number bytes let num[0] be LSW (least signifficant Word) So the operations involved are: mod: y … Read more
Finally it got solved. take a look. public class Solution { static int mod = 1000000007; static int summingSeries(long n) { return (int)(((n % mod) * (n % mod)) % mod); } private static final Scanner scanner = new Scanner(System.in); public static void main(String[] args) throws IOException { BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(“OUTPUT_PATH”))); int … Read more