# I am the Watcher. I am your guide through this vast new twtiverse.
#
# Usage:
# https://watcher.sour.is/api/plain/users View list of users and latest twt date.
# https://watcher.sour.is/api/plain/twt View all twts.
# https://watcher.sour.is/api/plain/mentions?uri=:uri View all mentions for uri.
# https://watcher.sour.is/api/plain/conv/:hash View all twts for a conversation subject.
#
# Options:
# uri Filter to show a specific users twts.
# offset Start index for quey.
# limit Count of items to return (going back in time).
#
# twt range = 1 10
# self = https://watcher.sour.is/conv/y7edboa
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.)
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.)
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 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 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
@xuu Yes, exactly that. *But*: I do have more than 32 bits after all, when I use double or long double. 😲 I went with long double which has 80 bits even on DOS (63 bits mantissa, I think).
(I only wrote a brute-force thingy this morning, so I didn’t even think about doing anything related to polynomials or double. 😅 Even part 2 only took 55 ms. But for DOS, this wasn’t an option anyway, so I did the proper math while waiting for something at work. 🤣)
It’s still a bit surprising to me. Usually, AoC doesn’t require such tricks and most things fit neatly into 32 bits. Maybe there’s a better solution after all. 🤔 I might have a look at reddit.
@xuu Yes, exactly that. *But*: I do have more than 32 bits after all, when I use double or long double. 😲 I went with long double which has 80 bits even on DOS (63 bits mantissa, I think).
(I only wrote a brute-force thingy this morning, so I didn’t even think about doing anything related to polynomials or double. 😅 Even part 2 only took 55 ms. But for DOS, this wasn’t an option anyway, so I did the proper math while waiting for something at work. 🤣)
It’s still a bit surprising to me. Usually, AoC doesn’t require such tricks and most things fit neatly into 32 bits. Maybe there’s a better solution after all. 🤔 I might have a look at reddit.
@xuu Yes, exactly that. *But*: I do have more than 32 bits after all, when I use double or long double. 😲 I went with long double which has 80 bits even on DOS (63 bits mantissa, I think).
(I only wrote a brute-force thingy this morning, so I didn’t even think about doing anything related to polynomials or double. 😅 Even part 2 only took 55 ms. But for DOS, this wasn’t an option anyway, so I did the proper math while waiting for something at work. 🤣)
It’s still a bit surprising to me. Usually, AoC doesn’t require such tricks and most things fit neatly into 32 bits. Maybe there’s a better solution after all. 🤔 I might have a look at reddit.