Atcoder Beginner Contest 206 | All Tasks Solutions

[@utkarshgupta9858]

Sprague Grundy Theorem (A concept required for last problem):
cp-algorithms.com/game_theory/sprague-grundy-nim.html

[@sanskarsharma9494]

Thanks :)

[@akshatjai258]

I got the idea of the theorem, but i just want to ask is the proof of theorem important to solve the problems or just the theorem statement is enough

[@shubhamagarwal2998]

video plz

[@shubhamagarwal2998]

No we started atcoder plz keep uploading it

[@adityaagarwal1650]

yes bro pls

[@devendrasingh4776]

I used graph and saw all connected components. Because i dont know anything about dsu . I will laern it today hopefully

[@devendrasingh4776]

@UCfWznZBepChox8KFn8zSIAw i got accepted 😊😊

[@sanskarsharma9494]

@@devendrasingh4776 Yooo....nice :)

[@shubhamagarwal2998]

same .. i also did dfs and no of nodes in each component-1 will contribute to ans

[@rangeyraghav130]

I solved D using a graph . I calculated the sum of depth of all connected components, it got accepted.

[@samprasdsouza6993]

Also , N- Number or trees works

[@madmax2442]

In Problem E, why did you do " if(l==1) l++; " in line 63 of your code? What is this corner case telling?

[@astelthottankara4108]

If l==1, then we are also considering pairs such as (1, 1), (1, 2)...(1, r). Gcd of these pairs is always 1 which we don't require, so we make l=2.

[@louisfghbvc]

Good Job!

[@akashagrawal9374]

No sir we participate in beginner contest, I personally found them very good

[@bipulkumar6637]

@utkarsh SIr can you give the resources for mobius function

[@RohitKumar-eo7qn]

Any update regarding your course ? I've been waiting for so long

[@AnuragSingh-ui2sb]

💯💯

[@nallasivakrishnasai1122]

Is this contest similar to Div3 of CF ?
Can anyone roughly provide the ratings According to codeforces for the problems after C ??
Thanks a lot 😊

[@utkarshgupta9858]

D 1600 maybe, E like 2000, F 2300

[@nallasivakrishnasai1122]

@@utkarshgupta9858 thanks a lot dude will try to give these contests from next time.
Please try to upload solutions of these contests whenever you have time 😉

[@learnbliss2046]

I had the same approach for C but didn't think of DSU for problem D.

[@kamleshjoshi2949]

Yhi toh chahiye tha 🙏

[@xXmayank.kumarXx]

yesterday's div2 where

[@jannatunnaim2757]

Please,upload the solution of atcoder beginning contest 221

[@pawanagrawal7653]

bhaiya I don't know dsu and graphs , is it mandatory to know graphs for learning dsu.

[@NNELATURIASHOKKUMAR]

Can i use binary search for the second problem?

[@rangeyraghav130]

Yes sum of n terms is a monotonic series .
So you can use binary search

[@NNELATURIASHOKKUMAR]

@@rangeyraghav130 Thanks

[@saurabhnikam]

left = 1;
right 1e5;
while(left = n)
{
}
else
{
}
I
ans = mid;
right= mid-1;
left = mid+1;
}
cout

[@master_coder8628]

Please also upload codeforces round. I always look upto ur videos for learning

[@abhishek04204]

Make video on dsu
I think u spent more time on yesterdays e2.

[@udayverma6120]

Hello bhaiya, I wanna know if CP is required for fracking interviews of companies like Uber, Google or leetcode is enough? Please reply

[@spyboy0076]

Cp is a process to sharpen your problem solving skills to crack intervies. If u can do the same by leetcode then do anyone of them