I've read problem G in the recent contest, and I find it quite interesting. Although I haven't attempted this task, I would like to know whether there exists a greedy solution. This is because I'm writing a number-guessing task similar to this (not a decision-making one though), and I want to make sure that the "guessing method" stated in that doesn't solve this task.
Thanks in advance.
- EDIT -
Since no one replies, I assume that there aren't any greedy / trivial solutions to this task. Should that be true, I'll continue writing my task.
Bye~
7th Contest of Newbies Date: December 31st, 2011 (Saturday) Time: 12:00 - 16:00 (UTC) URL: http://uva.onlinejudge.org
I believe there is greedy or some other kind of deterministic method to make correct guesses for this problem. Since, the performance the of the code of the top solvers is incredibly fast. They take only 0s. For the rest who solve the problem in standard way (well.. I believe we all solve it in pretty much the same way) take more than 1s. It's a huge gap.
if i'm not wrong you are from Bd, the truck behind you in the pic tells me that and most probably you are new to problem solving.
i'm sorry but i think the best hint i can give you is try the other problems first. its not a very easy problem as you might have thought at the first look. never mind may be someday you will solve even tougher problems than this one so be patient and keep solving.
Dreamer#1 wrote:if i'm not wrong you are from Bd, the truck behind you in the pic tells me that and most probably you are new to problem solving.
i'm sorry but i think the best hint i can give you is try the other problems first. its not a very easy problem as you might have thought at the first look. never mind may be someday you will solve even tougher problems than this one so be patient and keep solving.
best of luck
Thanks Dreamer. You are right, I am from bd. And i will try to follow your hints.