Editorial for Codeforces Edu Round 162 E : Count Paths (DP on Trees)

แชร์
ฝัง
  • เผยแพร่เมื่อ 14 ม.ค. 2025

ความคิดเห็น • 9

  • @cfstepofficial
    @cfstepofficial  10 หลายเดือนก่อน

    Code, Slides, Practice Problems, Tutorials, Hints are available at cfstep.com/codeforces/contests/contest-1923/problem-e/

  • @juswanth.t133
    @juswanth.t133 7 วันที่ผ่านมา

    Loved it

  • @JaiSehgal-ge6cj
    @JaiSehgal-ge6cj 8 หลายเดือนก่อน

    Amazing explanation, great found laid for making the question easily understandable

  • @caiodavi9829
    @caiodavi9829 10 หลายเดือนก่อน

    thanks for your efforts! your videos are very helpful

  • @lectures6035
    @lectures6035 10 หลายเดือนก่อน

    Most helpful cp channel on TH-cam.
    My only complaint is less number of videos. Please make more.
    Like for ARC and last 2 problems of ABC and cf DIV2. I know it takes a lot of effort in creating quality content, but please do it as much as possible.

  • @vibhavdubey9060
    @vibhavdubey9060 10 หลายเดือนก่อน

    make more videos bro!!
    you explain really well.

  • @x87-64
    @x87-64 10 หลายเดือนก่อน

    ????????????
    bro you explained the most trivial DP in this 20min video
    and did not even touch upon the question

    • @cfstepofficial
      @cfstepofficial  10 หลายเดือนก่อน +1

      The intended solution uses Small to Large, but the foundation for that is the DP discussed in this video. I also mentioned this fact while sharing the video on CF that it doesn't talk about the Small to Large trick involved, just the DP idea behind it. Apologies if you misinterpreted. codeforces.com/blog/entry/126339#comment-1122179

    • @x87-64
      @x87-64 10 หลายเดือนก่อน

      ​@@cfstepofficialhmm it's alright
      i just spent a few hours learning small to large and now it's time to implement this question
      wish me luck lmao