A,B,C,D1 | Codeforces Round 931 Solutions | Find a Mine | Yet Another Coin Problem | Too Min Too Max

[@AbhinavAwasthi]

Join Telegram: telegram.me/cpabhinav

[@chayanghosh814]

I don't comment much but ..
Man ur sense of finding hidden patterns in the question is so great...... I have been following u for a while now ....u have the unique and the best way to approach problems ....U inspire me to find patterns in problems which allows me to solve a lot of them sometimes even when i see no clue....Thanks for such a massive contribution in this community and you... as well as ur explanations are highly underrated..

[@AbhinavAwasthi]

Thanks a lot

[@jitendrakumar-vv8ho]

yeah i too agree the 2nd question approach was lit i couldn't crack it in 2 hours man

[@VishalYadav-gk1kg]

Very nice explanation sir, Thank you!

[@AbhinavAwasthi]

Welcome

[@whoamI-ht4op]

Explanation was lit🔥. And yes can you please post how to solve interactive problems.

[@AbhinavAwasthi]

Thanks sure

[@AbhinavAwasthi]

Thanks sure

[@Invincible2203]

No need to use map as it will cost log(N), i have solved it in O(1), we can store n/15 in ans and n%15 in remainder and then using if else conditions check remainder is 0 or 1 or 2 ... or 14. Then we can output ans+(whatever we get after no. of coins have been minimized). But we must be careful when remainder is 5 or 8, then output will depend on n also.

[@AbhinavAwasthi]

Yes, but for 15 values there is no effect

[@vypw3p634]

we need more this type of interactive problems

[@AbhinavAwasthi]

Sure

[@abirh7161]

For B my solution was simple and not think too much. I run dp for n

[@mkshuvo5141]

is that bottom up aproch

[@abirh7161]

@@mkshuvo5141 int recur(int a[],int sum,vector &dp){
int res=INT_MAX;
if(sum==0){
return 0;
}
if(dp[sum]!=-1){return dp[sum];}
for(int i=0;i

[@AbhinavAwasthi]

Nice

[@Mohamed_Amine_Bennacef]

Explanation is Fire

[@103_shashvattiwari6]

for second question first i make the array of coins and tried with all permutation of the coins array and return minimum answer of them but it not passed the last two input 98 and the bigger one.

[@itsmepratham2712]

i am prioritizing codeforces only so is it fine no? not solving on CodeChef and doing practice on cf only so is it fine?

[@AbhinavAwasthi]

Any specific reason?

[@itsmepratham2712]

@@AbhinavAwasthi no not any specific reason but for clarification that what questions to solve like on cf i am solving 1100 rated because I feel I am comfortable with 1000 so for the clarity purpose only

[@AbhinavAwasthi]

It's fine, but you can participate in codechef contests

[@bhargavijethva7958]

Nice explanation!👏👏

[@AbhinavAwasthi]

Thanks

[@lemniscate23]

very nice contest and very helpful solutions....

[@AbhinavAwasthi]

Thanks

[@Now_I_am_all_fired_up]

Sir ab mujhe lag rha hai drr kyoki last 2 contest B bikul nhi hua ..

[@AbhinavAwasthi]

koi baat nhi, dar ke aage jeet hai, try krte raho

[@nishcurse]

same mujhko bhi yahi hua pehle b ho jata tha

[@AbhinavAwasthi]

​@@nishcurselast contests se thoda tough bhi aa rha hai

[@mkshuvo5141]

nice thinking❤

[@AbhinavAwasthi]

Thanks

[@rudraprotabchowdhury5186]

helpful

[@AbhinavAwasthi]

Thanks

[@Shobhitchoudhary321]

Thank you sir

[@AbhinavAwasthi]

Welcome

[@hxgaming8886]

good it was good

[@AbhinavAwasthi]

Thanks

[@sangeetsangwan2622]

sir please share the cp specialist sheet

[@AbhinavAwasthi]

Please check my Instagram

[@abdelhakimlamnaouar9527]

but how can we prove that the answer for problem B is optimal

[@AbhinavAwasthi]

Because it's accepted 😂
Actually we are trying to maximise use of 15 rupee coins and then for other cases also we have taken optimised values in map

[@abdelhakimlamnaouar9527]

@@AbhinavAwasthi 🤣 but maybe it will be hacked, because maybe there are other cases other than 5

[@AbhinavAwasthi]

It's not maybe, I have checked multiple cases

[@AbhinavAwasthi]

You can try hacking maybe 😂

[@abdelhakimlamnaouar9527]

🤣

[@preetu391]

Helpful! 🙌

[@AbhinavAwasthi]

thanks

[@anonymousanonymous7507]

HOW WILL U DO B WITH DP LIKE MINIMISING COIN OF CSES PLS SHARE CODE

[@AbhinavAwasthi]

Can't do Bec of high constraints