Vigyata.AI
Is this your channel?

Problem A,B,C,D1 | Codeforces Round-740(Div-2, based on VK Cup 2021- Final (Engine) | Live Chat

6.6K views· 401 likes· 104:49· Aug 25, 2021

🛍️ Products Mentioned (5)

Link to Solutions: Hey, My name is Mihir Singh I am an active competitive programmer. You can connect with me here: My codeforces profile: https://codeforces.com/profile/kassutta My LinkedIn profile: https://www.linkedin.com/in/mihir-singh-848531170 My instagram profile: https://www.instagram.com/mihirre_singh/ Practice problem similar to D1 concept: https://cses.fi/problemset/task/1082#:~:text=CSES%20%2D%20Sum%20of%20Divisors&text=Let%20%CF%83(n)%20denote%20the,)%20modulo%20109%2B7. Use Special Code MIHIR10 to get 10% off on your Unacademy Subscription 10% Discount on any GFG course, Use Code: MIHIR DSA self-paced: https://practice.geeksforgeeks.org/courses/dsa-self-paced Link to all courses: https://practice.geeksforgeeks.org/courses/online Timestamps: 00:00 : Setting Up Live Stream and Chatting 06:26 : Problem B 43:14 : Problem C 01:03:06 : Problem D1 01:29:05 : Problem A For any queries: contact us at cp.gatecs@gmail.com Follow us on-- @discord:- https://discord.com/invite/6kcmVQx8Fx @facebook:- https://www.facebook.com/Quarantine-Engineers-107789377679897/ @linkedin :- https://www.linkedin.com/company/quarantine-engineers @instagram :-https://www.instagram.com/quarantine_engineers/ @telegram(Channel) :- https://t.me/quarantine_engineers @telegram(Discussion Forum) :- https://t.me/qe_discussion #Codeforces #740 #DIV1

About This Video

Is live stream me maine Codeforces Round 740 (Div-2, VK Cup 2021 Final based) ke A, B, C aur D1 problems ko solve/derive kiya, with proper live-chat style discussion. Start me thoda setup + chatting hai, but main focus ye tha ki statement ko kaise decode karna hai—especially Problem B jaisa confusing tennis/serve-break wala statement. Maine clearly explain kiya ki “break” ka matlab current game me server ka haarna hai, aur important twist ye hai ki har game ki first serve alternate hoti hai (regardless of who won), yahi cheez sabse zyada log miss kar dete hain. Problem B me maine approach build ki: total games = a+b, fir do possible cases (kaun pehle serve karega) aur har case me possible break counts ko enumerate karke set me store kiya. Main idea: dono players ke total serves fixed ho jaate hain (either ⌈n/2⌉ and ⌊n/2⌋), fir server-side wins/loses se breaks count nikalta hai. D1 ke liye maine similar concept practice ke liye CSES “Sum of Divisors” recommend kiya, kyunki waha bhi observation + implementation discipline chahiye. Overall takeaway: pehle statement ko 100% nail karo, phir cases banao, aur unique answers set me collect karo—contest pressure me ye method kaafi reliable hai.

Frequently Asked Questions

🎬 More from Quarantine Engineers