There are two types of vaccines available: Covaxin and Covishield.
You have X Rs and you want to buy as many vaccines as possible.
(i+1)^{th} dose of Covaxin costs A + i * B Rs for every i >= 0.
(i+1)^{th} dose of Covishield costs C + i * D Rs for every i >= 0.
You have to determine what is the maximum quantity of vaccines (both covishield and covaxin combined) can you buy.
Solve the problem: https://bit.ly/3l249D4

In today’s episode of #AnybodyCanCode: https://buff.ly/3zSieZZ, Arnab Chakraborty, a certified expert in Python, will discuss the various features of the language.
This beginner-level series is designed to give you a full introduction to all the core concepts of Python, one of the fastest-growing languages. So tune in every day at 5 PM, and learn more.

Join us today for the next episode of ‘DSA for Placements’: https://bit.ly/3jMnlWa, where Mohammad Fraz will give an introduction to Graphs.
This is the final week of the series, and we’ll be covering a lot of important topics you need to know to ace the interviews, so make sure to tune in every day at 8 PM.

Join Fast
We are Live 🔴
https://youtu.be/Odsgzdopivw

All you need is the mindset to search and listen, and you will find answers to all your questions! Improve your projects, gain technical competency, understand the importance of CP ratings, and much more, with our weekly live shows: https://bit.ly/3jPC7eD. Get access to exclusive content from industry experts for just Rs 83 per month for a one-year subscription. Use discount code: CODECHEF.

🎯The Technical Interview Question series covers all the must-know questions that you need to learn to ace your technical interviews. In this, Saptarshi Mujherjee, SDE @ Google will talk about questions that have been asked multiple times in various top-notch company interviews like Google, Amazon, Microsoft, Facebook and many others. You will find all the essential concepts required for solving the question to writing the code to understand and learn all about the frequently asked interview questions.
🔸Here You can watch the complete Technical Interview Questions series playlist, click here : https://bit.ly/3Dj9P43

We hope to see more schools & colleges participate in SnackDown 2021. Hurry up, and register now:https://bit.ly/2WYqKrK!

You are given N distinct points in a 2-D plane, numbered 1 through N. Your goal is to make the location of all the N points equal. To achieve this, you can do some operations.
In one operation, you choose an index i(1 <= i <= N) and a real number K and change the location of the i^{th} point in one of the following ways:
- Set (X_i, Y_i) = (X_i + K, Y_i)
- Set (X_i, Y_i) = (X_i, Y_i + K)
- Set (X_i, Y_i) = (X_i + K, Y_i + K)
- Set (X_i, Y_i) = (X_i + K, Y_i - K)
Find the minimum number of operations to achieve the goal: https://bit.ly/3yS4kFW.

Register for SnackDown 2021: https://bit.ly/3tvjpfB
The video editorial for the 2nd problem (TEMPLEA) of the SnackDown Practice Contest for beginners is out: https://www.youtube.com/watch?v=9UKQu1V2wKM. Check out the detailed explanation of the problem by our expert educators, improve your skills and logic and master the art of Competitive Programming.

The first Starters of September is here: https://bit.ly/3hbKvUi! Rated only for Division 3 coders, the contest will go live on Wednesday, 15th September at 8 PM IST. So start your preparation now and give this your best shot.

Another episode of Weekends With Champions is on its way: https://bit.ly/3ha1hCV, and this time we are talking to Nishant Chitkara, two times ICPC regionalist. Join us on September 11th and get to know how he cracked the competition!

🔴You can checkout the complete DSA For Placements -Learn the Basics, course in Bilingual, Click on the playlist link - https://bit.ly/3kflAjf