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

Step by Step 366D Dima and Trap Graph
Автор Alex7, история, 8 лет назад, По-английски

So here is another installment of my step by step series, trying to solve 366D - Dima and Trap Graph :D please enjoy. Link here.

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

»
8 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

That problem is going to have many submissions right now !!!

→ Ответить
  • »
    »
    8 лет назад, # ^ |
      Проголосовать: нравится +1 Проголосовать: не нравится

    I'm planning on doing videos on the best problems I've solved throughout my time here on codeforces :D. If you have any suggestions or ideas please tell me :D

    And have fun :D

    → Ответить
»
8 лет назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

Just a humble suggestion Alex7 , i think you should make the video for each problem in two parts : 1. Covering the algo 2. Covering the implementation . This way you can take enough time explaining the entire stuff . It has some advantages, such as :

  • Someone can first try to implement the logic themselves first before seeing your implementation.
  • You get more time to explain everything without any hurry . Like in this video ,i couldn't understand the part where you talks about taking maxl as constant .
  • Each video will be no longer than 10-12 minutes and people can watch both or anyone part of it depending on their weakness-whether they struggle with coming up with the algo or they struggle in implementing their idea .

BTW, great initiative and lots of thanks :D

→ Ответить
  • »
    »
    8 лет назад, # ^ |
      Проголосовать: нравится +7 Проголосовать: не нравится

    I'm still running experiments. Last time, people complained that my video was too long so I tried to shorten it. But I'll think about it thank you for your feedback.

    → Ответить
  • »
    »
    8 лет назад, # ^ |
      Проголосовать: нравится +5 Проголосовать: не нравится

    you can pause the video by the way :D :D

    I think it is better as one part as it is now :)

    → Ответить
»
8 лет назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

Very Nice Alex.. But i prefer shorter videos :-)

→ Ответить
»
8 лет назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

this is great.. but I will try to solve the problem before watching the video :p

BTW, Nice job with this series.. this is a whole new step in this community and I think many contestants will find it useful. I know cause I couldn't find any good tutorials when I started practicing :(

→ Ответить
»
8 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Great tutorial! Although I would prefer harder problems.

→ Ответить