Блог пользователя magieNoire

Автор magieNoire, 12 лет назад, По-английски

Hello everyone,

Can someone please take his/her time to explain how to solve the problem Bugs in Code. All what I have come up with is an O(n2logn) solution which is too bad.

Update: I have already seen the editorial but I couldn't understanding it.

Update2: I got it accepted.

  • Проголосовать: нравится
  • -15
  • Проголосовать: не нравится

»
12 лет назад, скрыть # |
 
Проголосовать: нравится +3 Проголосовать: не нравится

I'd advise you to open the problem again and look at the "Contest materials" section.

  • »
    »
    12 лет назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    Don't be like that, please. You're not the smartest one here. Most of your comments are really irritative. You're not as cool as you probably feel yourself.

    • »
      »
      »
      12 лет назад, скрыть # ^ |
       
      Проголосовать: нравится +20 Проголосовать: не нравится

      Again I need to defend myself...

      First, I'm pretty sure that the author didn't read the tutorial (because he didn't look around to find it).

      Also, the author doesn't even explain his solution. I see it as if he doesn't want to help those who may try to help him.

      Also, in this case it's obviously not a good way to create a new blog post to ask about the solution — it'd be much better to post a comment to the tutorial. Other people may have the same questions, and they'll be able to read the answer and not to ask these questions again.

      Summary: the author behaves very egoistically, and I'm not sure if his behaviour is in any sense better than mine.