query: Minimizing the number of operations of subtracting one so as to get to $0$
positive_passages.docid: 150726
positive_passages.text: determine the least number of rounds that needs to be played so that every child is satisfied
negative_passages.docid: 155493
negative_passages.text: Minimum value of the expression given below.
negative_passages.docid: 102542
negative_passages.text: Is there a way to reverse factorials?
negative_passages.docid: 115236
negative_passages.text: Calculate the sum of inverse values of ${n\choose 0}, {n\choose 1}, ... {n\choose n}$
negative_passages.docid: 127742
negative_passages.text: NMinimize in one-dimensional Interval
negative_passages.docid: 59419
negative_passages.text: Crafty solutions to the following limit
negative_passages.docid: 105873
negative_passages.text: Construct an algorithm to find the multiple of A such that A%B is maximized
negative_passages.docid: 126025
negative_passages.text: Computing the inverse of a permutation
negative_passages.docid: 18795
negative_passages.text: Find the Smallest Integer Not in a List
negative_passages.docid: 44763
negative_passages.text: Modulo operator with negative values
negative_passages.docid: 92536
negative_passages.text: Avoiding nested for loops
negative_passages.docid: 34325
negative_passages.text: Minimizing $\sum_{i=1}^n \max(|x_i - x|, |y_i - y|)$ - Sum of Max of Absolute Values
negative_passages.docid: 112843
negative_passages.text: What is the proper way to extend the Fibonacci numbers to negative numbers?
negative_passages.docid: 118232
negative_passages.text: Is it possible for the Lagrange multiplier to be equal to zero?
negative_passages.docid: 9118
negative_passages.text: Polynomial division: an obvious trick? [reducing mod $\textit{simpler}$ multiples]
negative_passages.docid: 69228
negative_passages.text: Factorial of 0 - a convenience?
negative_passages.docid: 153831
negative_passages.text: Approximating $\pi$ with least digits