There was an issue I’ve learn greater than 15 years in the past. I simply bear in mind the issue and the tough define of the answer, and I want to know if it has a canonical identify to lookup the calculation and variations.
The issue is that you’ll obtain a 100 presents in sequence, you possibly can solely settle for or reject so as, and upon getting rejected a suggestion, you can’t return. What’s your technique to maximise your features?
This may additionally be a problem-family, and I may not bear in mind a few assumptions, in the event that they change into crucial.
And the answer was roughly…
You probably have N presents, you wait till some fixed (some perform of e perhaps?) occasions sq. root N, then you definately settle for the primary provide that’s bigger than or equal to the utmost of the primary batch.
