PeterNaut's blog

By PeterNaut, 11 years ago, In English

Which programming problems have you enjoyed the most solving or you like its solution best, etc.?

  • Vote: I like it
  • +33
  • Vote: I do not like it

| Write comment?
»
11 years ago, # |
  Vote: I like it +8 Vote: I do not like it

I liked 297E - Mystic Carvings, mostly because of the emoticon-like figures :). It also has a very elegant solution.

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

My favourite problem is 242E - XOR on Segment.

  • »
    »
    11 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    you remembered me this blog :D

    • »
      »
      »
      11 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Amazing. Maybe you were lucky or submit it when the sever wasn't busy. I just copied your code and submit it and it get TLE!!! Here's the submission 3699691.

      • »
        »
        »
        »
        11 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        server does not affect the speed of compiler, try to submit it many times because the running time of this code is nearby the time limit and there is a little bit difference between running time for each submit, so I think you will succeed after a few tries :)

        • »
          »
          »
          »
          »
          11 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Yes. You are right. But you ARE lucky due to passed all tests in your first submission of this code :)

  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Which data structure did you use to solve the problem?

    • »
      »
      »
      11 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      clearly it's segment tree.

      you can find here tutorial for this problem.

    • »
      »
      »
      11 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Segment tree. Actually I never understand segment tree and have many problems to code it for many problems, but I do code it for this problem. That's why I liked it. My code passed all tests using almost half of limits.

»
11 years ago, # |
  Vote: I like it +11 Vote: I do not like it
»
11 years ago, # |
  Vote: I like it +8 Vote: I do not like it

My favourite problem is 196B - Infinite Maze, from our contest. Idea: Hohol. Easy and tricky.

»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it
»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it

229C - Triangles is very interesting problem in my opinion.

»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it