The Egg Drop — Solution & Editorial

Back to the Problem

Invert the DP: dp[t][e] = the maximum number of floors distinguishable with t drops and e eggs = dp[t−1][e−1] + dp[t−1][e] + 1. Increase t until it reaches F.

Complexity: O(E · answer)

Watch out: The naive floor-by-floor DP is O(E·F²) and dies at F = 10⁹; the trials-first inversion is essential.