|
|
вернуться в форумWe can prove that nobody will turn the vales more than once, beacuse if so,he will do things with no effect so that the answer will not be the best one. So there are 2^N situations. I only use search with cut some "bad" answer and got AC. Sorry for my bad English... I also tried this method and got TLE. Can you give me your code? My e-mail is barssimfi@mail.ru Could you paste your code here? What is "bad" in your opinion? |
|
|