For 10 points, name this number that's used in the binary system along with one.
This value is the lower bound on the number of copies in the Bounded Knapsack Problem. This value is represented by K in Excess-K, and the first step of Dijkstra's algorithm is to set the distance of every node to either infinity or this value. It is equivalent to (*) false in C++. This value is typically the first index of an array, so many programming languages are said to start counting from this number. Exceptions can occur when dividing by this number. For 10 points, name this number that's used in the binary system along with one.
This value is the lower bound on the number of copies in the Bounded Knapsack Problem.
zero