Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on From Tower of Hanoi to Counting Bits (2011). Parent comment
> We will be dealing with arbitrary precision integers (bignums) in the problem, so let us also make a few assumptions:
> Addition or subtraction of an m-bit integer and an n-bit integer (m <= n) takes O(n) time.
> Counting the number of 1-bits in an n-bit integer takes O(n) time.
There are no comments on this comment yet.
> We will be dealing with arbitrary precision integers (bignums) in the problem, so let us also make a few assumptions:
> Addition or subtraction of an m-bit integer and an n-bit integer (m <= n) takes O(n) time.
> Counting the number of 1-bits in an n-bit integer takes O(n) time.