Codeforces Round 745 Solutions || Problems A,B and C. 

The problem C's dp solution is so unique! I had gone upto prefix sum part but this DP optimasation is on another level!

Thank you so much for this video, I was struggling with problem C! Subscribed👍.Please continue to make more contest videos.

good job bro l,iked your efforts, you are helping student community!!

Elegant solution of question 3 man ❤️

Loved this! Man I solved A in virtual contest by doing bruteforce and seeing pattern :p. problem A was harder than B in my opion!

46:30 last line : why do we need to convert all cells in (i-1)th row to 0? the left and rightmost cell shud be 1 right?

VV NICELY EXPLAINED

your explaning level is god like

Unabel to understand how "the no. of permutations having values < n == the no. of permutations having values > n" ? Please explain me again!

hey, nice explanation...can you make a video of the general approaches required to solve the a, b, c problem of codeforces, like when we first see a problem one approach comes to mind , then we look at the constraints , try out a approach ,if it does not work then move to the next, obviously every problem is unique , but pl. make a video on what hints we should look (in the ordered sequence which you have developed after solving a lot of problems) for while solving the a, b, c problems (specially c) , to arrive at the correct intuition faster.

Hi bro can you make a guided video on how you practice for competitive Programming learn new topics and devote time and also what to do if not able to make logic.

nice explanation

Thanks

thanks for the video. can you explain please how did you get formula 2^n-1? @4:30? please explain, getting a little confused here.

You, really have good hands on DP. can you pls share any resource which you specifically used for practicing DP.

39:00

Can you share the code and explain the mod_mul() and inv() & why modulo inverse ?

can we calculate the prefix by doing row wise 1d array sum then doing it column wise?

Why are you making it as two different cases "width 5 and width>5"

A is hard