Today’s AoC puzzle is a very simple problem on modern machines, but quite tricky for me: It involves a number that doesn’t fit into 32 bits. 🤔 I wonder if/how I can manage to port this beast to DOS. (I once wrote a “big int” library myself, but that was ages ago and I hardly remember it anymore.)
@movq@www.uninformativ.de it shouldn’t need a full bignum implementation right? Just some left and right shifts for the sq/sqrt and carry for the addition right?
@movq@www.uninformativ.de it shouldn’t need a full bignum implementation right? Just some left and right shifts for the sq/sqrt and carry for the addition right?
Oh.. Right. Need subtract and divide too for the binomial
Oh.. Right. Need subtract and divide too for the binomial