[CSES][Dynamic Programming] Minimizing Coins

cses.fi/proble...

[@AmanKumar-nj5sz]

I watch your videos even if I can solve a problem on my own, just to solidify the idea in my head. Great content!

[@neatlystructured]

this means so much to me, thank you!

[@bitoutofcontext]

your explanation is absolutely amazing, thank u so much

[@swarajshelavale4830]

I will surely refer your channel to all my collegiate friends...(CP programmers)

[@neatlystructured]

I will really appreciate it if you do!

[@infamoustony]

keep it up my man

[@neatlystructured]

Thank you!

[@infamoustony]

@@neatlystructured you're great at explaining man

[@swarajshelavale4830]

Best Content Bro.....
Thanks man for such amazing videos....
Keep gooing....
Best Wishes

[@neatlystructured]

Thank you very much !

[@Rajat_maurya]

bro great thanks for making these videos

[@gauravkumargupta9622]

In the last line, what is the use of ? symbol at INF? , what does this symbol do and why you used it here?

[@swarajshelavale4830]

Which IDE do you use to code ?

[@neatlystructured]

I use Vim.

[@programmertik2046]

Why is this recursive code giving RE for some tc in CSES ??
Plz help !
ll miniCoins(ll idx, ll sum, vl &v, vector &dp)
{
ll sz = v.size();
if (idx == 0)
{
return sum % v[0] == 0 ? sum / v[0] : 1e8;
}
if (dp[idx][sum] != -1)
{
return dp[idx][sum];
}
ll pk = 1e8;
if (v[idx]

[@happydilraj3350]

bhai iska pta chla tha ky??
esa ku ho rha

[@apoorvprakashgupta7437]

changing paratemeters index aur sum hn to 2d dp bnegi , constraint dekho, n=100, sum=1e6, to dp[100][1e6] ki bnegi, lkin ye possible nhi h, 2d vector max 1e6 cells ka ho skta h