4o2a's blog

Optimality of today's E problem
By 4o2a, history, 4 hours ago, In English

In today's E problem, my submission used exactly n-1 queries for each n to give out the answer. Can this be proven to be the least number of queries needed or is a better bound achievable?

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
3 hours ago, # |
  Vote: I like it +11 Vote: I do not like it

E was one of all time CRINGE problems.

→ Reply
  • »
    »
    49 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    why?

    → Reply
»
3 hours ago, # |
← Rev. 2   Vote: I like it +16 Vote: I do not like it

Obviously, you can binary search for the first $$$i$$$ such that $$$f(1, i) > 0$$$, but it's still $$$O(n)$$$ queries in the worst case.

→ Reply