Network with the people who will help you grow. With access to industry specialists and top IT professionals, you can grow at an even faster pace: https://bit.ly/3trAhDP! Learn the A to Z on how to ace your technical interviews, get your projects reviewed by experts, understand how you can increase your CP ratings, build your technical competency, and much more for just Rs 83 per month for a one-year subscription. Use code CODECHEF for an extra discount.

Let f(n, B) be the sum of digits of the integer n when written in base B.
Given Q queries, each consisting of three integers n, L, R, find B such that f(n, B) is minimum for all L <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/3l3oCYl

Tune in at 8 PM today for the next episode of 'DSA for Placements': https://bit.ly/3E2gK1Z, where Mohammad Fraz will discuss some practice problems on Dynamic Programming.

Starters 11 will be here on 15th September, 8 PM IST onwards: https://bit.ly/2X1fv2s. So div 3 coders, make sure to participate and show off your coding skills.

This is your chance to participate in SnackDown 2021: https://bit.ly/3yXLgpN and make your college proud. Register right away, and start your preparation!

What if we told you, you can have access to exclusive content by top educators to help you ace all your interviews for just Rs 83 per month for a one-year subscription: https://bit.ly/3l6JqxX? Get expert help for your projects, improve your technical competency and CP skills, and much more! Use code: CODECHEF for an extra discount.

Let f(n, B) be the sum of digits of the integer n when written in base B.
Given Q queries, each consisting of two integers n, R, find B such that f(n, B) is minimum for all 2 <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/2YyvIfG

Register for SnackDown 2021: https://bit.ly/3ldDpj4
The video editorial for the next problem (SNAKPROC) of the SnackDown Practice Contest for Beginners is out now: https://www.youtube.com/watch?v=hjrWtthd8WU. So go right away, and take a look at the logic and the concepts.

Who wouldn't love a hot debate, right? Announcing a new series, where two top coders will discuss and put forward their opinions on various topics. This week, we have Rajarshi Basu (NUS Undergrad researcher, CC Contest Editorialist) and Saptarshi Mukherjee (SDE @ Google, ICPC 19 regionalist) go face to face and debate on whether Java is better than C++ or not: https://buff.ly/3hkuCLc. Join us this Sunday at 5 PM to get an answer to this.

Register for SnackDown 2021: https://bit.ly/3ldDpj4
The next problem in the SnackDown Practice Contest for Beginners is live now: https://bit.ly/2Vwt8px, and it is one of the best. So start practicing now, and get your concepts right.

Starters 11 is here: https://bit.ly/3tCIBAT and it’s your chance, Division 2 & 3 coders, to increase your ratings on September 15th, at 8 PM IST.

Saturday is here, and so is the much-awaited episode of Weekends With Champions: https://buff.ly/3l7bhOs. This time Nishant Chitkara, two times ICPC regionalist, will be joining us for a live AMA session at 3 PM. We will be discussing his programming strategies and approach, and you can get all your doubts cleared as well.

Success is no accident, and it happens with constant effort and the right guidance. Bringing you mentors and well-acclaimed experts who can guide you and help you out with your doubts, projects, improve your technical skills, and much more: https://bit.ly/3z7hJKh. And all this for just Rs 83 per month for a one-year subscription. Use discount code: CODECHEF

Chef lives in an N * M grid. He is currently participating in a treasure hunt and has two items left to find. Chef knows that the Manhattan distance between the cells containing these two items is exactly k. He wants to know, how many different pairs of cells can the two items be in.
You need to answer this question for each k between 1 and N + M - 2: https://bit.ly/3BWk7Wa

Your CP ratings help you open the door to many possibilities, and this is your chance to increase your ratings! Participate in Starters 11: https://bit.ly/2Xf04ng on September 15th and test out your newly learned CP concepts.
Do note, the contest is rated for both Div 2 & 3.

Well, you surely didn't know that, right?! Stay tuned for more amazing facts, and start preparing for the ultimate competition right away. And in case you haven't already registered for #SnackDown2021, then hurry up, and register right now: https://bit.ly/393EXq4!

Rajarshi Basu (NUS Undergrad researcher, CC Contest Editorialist) and Saptarshi Mukherjee (SDE @ Google, ICPC 19 regionalist) will join us today for a fierce debate on whether C++ or Java is the most important programming language to learn. Tune in at 5 PM sharp to know their opinions: https://www.youtube.com/watch?v=Eq1BJZdI7M0

The video editorial for the next problem (KTTABLE) of the SnackDown Practice Contest for Beginners is out now: https://www.youtube.com/watch?v=J6BSWLZfTb0. So go right away, and take a look at the logic and the concepts.