You are given an array A of size N initially filled with 0-s.
There are M types of operations that you can perform on array A. The i^{th} operation can be described by two integers (x_i, y_i). In this operation, you choose a set of indices S such that
- 1 <= j <= N,
- (j % y_i) != 0,
- A_j = 0,
, then you set A_j = x_i for all j in set S.
You can perform the operations in any order, but one type of operation can't be done more than once. What is the maximum sum of integers of the array A you obtain if you perform the M operations optimally?

Solve the problem: https://bit.ly/3xzoR1w

After more than a month, we are back again with the second edition of Tech Interview Hacks! This weekend event is curated for all the intermediate and advanced coders to get better at their game. Join us this weekend for 15+ hours of classes and ace all your interviews!

Register Now: https://bit.ly/3AuNoXq
Use access code: CODECHEF

Problem#4 (FSQRT) is live on the website now!
https://bit.ly/3fN6iAE
The contest is now heating up, and to make it extra challenging, try solving the question without using the inbuilt function. If this is the first time you are trying a hand in this, check out the August challenge's previous questions.

Part 2 of Linear Data Structures is here. Prepare for ICPC with an expert and learn everything you need to know about List, Stack, Queues, and much more.

https://www.youtube.com/watch?v=7_JSlzjzhPc

The month just started, but the Long Challenge is halfway through. Participate in this contest rated only for Division 3 coders and stand a chance to win prizes, goodies, and laddus!
Compete Now: https://bit.ly/3lQArTw

The third edition of Elevate 2.0 is here, and we can't keep calm! You shouldn't miss out on this weekend Programming Aptitude Test as the stakes are as high as getting a full scholarship to Learn CP from the best.

Enroll Now: https://bit.ly/3CytBZ3

Use access code: CODECHEF

Are you wondering how to implement Stacks and Queues? Prepare for all the upcoming contests and Olympiads with this video, where one of the top coders explains Linear Data Structure in detail.
Watch Now: https://youtu.be/pqrWsi5gmjc

We are back again with new courses and batches! Learn OS, DBMS & Networking from the best in the industry with the second edition of Transpire https://bit.ly/37BEZVM. Mahaydodha 4.0 will help advanced coders to level up their game. https://bit.ly/2VEhyc4 The fifth edition of the most famous batch, Eklavya, to master the art of programming using Java. https://bit.ly/3xBF1re

Use coupon code: CODECHEF

A triplet of integers (A, B, C) is considered to be special if it satisfies the following properties for a given integer N:

- A % B = C
- B % C = 0
- 1 <= A, B, C <= N

Find the number of special triplets for the given integer N.

Solve the problem: https://bit.ly/2VJlTKM

Standard Template Library or STL is one of the crucial concepts that a programmer should have a good grasp on. In this video, Aryan Agarwal will be discussing A to Z of STL that you need to know.
Watch now: https://youtu.be/gNgRr-oJysY

Fifth problem of the Augusta Challenge is here. Pattern problems are always a must know for all the coders, and today’s problem ( PPATTERN ) is the one of the most basic ones that you should try out. If this is the first time you are trying your hand at Competitive Programming, then head over and check out the previous questions.

Solve the problem: https://bit.ly/2VLb0YP

Interviews and campus placements have already started for many, and now is the apt time for you to go through a few of the essential frequently asked questions by top-notch companies. Check this out to read and learn more about Sliding Window Maximum, one of the very challenging questions.

Read here: https://bit.ly/3jRynbd

If this question racks your brain, then you sure should participate in the 3rd test of Elevate 2.0. Attempt the 1-hour MCQ-based aptitude test on Saturday and stand a chance to win exciting scholarships to the Learn Competitive Programming subscription!
Enroll Now: https://bit.ly/3lX1g8I
Use access code: CODECHEF

You are given a convex polygon with N sides. You have to answer Q queries. The i^{th} query is described by two integers v_i, t_i. In this query, all sides of the polygon start moving parallel to their respective perpendicular vector away from the centroid with a constant velocity of v_i units per sec. Output the final area covered by N sides of the polygon after time t_i seconds.
For each query, consider the initial coordinates of vertices of the given polygon.
Solve the problem: https://bit.ly/3m2Fkci

Here’s the next video in the ICPC Preparation Series. Today we will have a look at two crucial topics, Divide and Conquer and Binary Search algorithm.
Watch here: https://youtu.be/S1_Vfg3XAv0

In this week's Frequently Asked Interview Problem series, Saptarshi Mukherjee, incoming SDE at Google, will be solving the Trapping Rainwater problem. This is one of the critical and challenging problems asked by many top-notch companies.
Problem Statement: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
Join us at 6 PM today as he discusses how to approach the question, what are the concepts, and how to implement them in the given question.
https://bit.ly/3yKDa4K

Announcing something new! How about Live Shows that are precisely about your career? Watch our experts as they speak with Technical Recruiters about current hiring trends and IT professionals who have won against odds to start successful careers. Catch them to discuss college projects, hiring updates from companies, how to improve your CP star ratings, and everything that you could ask for. A segment that contains highly-researched content and findings. Subscribe Now to watch all these exclusive shows for just Rs 999 per year.

Subscribe here: https://bit.ly/3m2mzWu

Use Code - CODECHEF for your discount.

There are N people in a train and each of them gets on the train at time t = 0.
Each person on the train wants to use the charging station on the train for some amount of time, but unfortunately, the train has only one charging station and can only be used by 1 person at any point in time.
The i^{th} person wants to use the charging station for A_i minutes in total and will leave the train at time T_i.
A person will be satisfied after the journey, only if that person gets to use the charging station for the desired amount of time.
Find a way to schedule the charging such that a maximum number of people is satisfied.
Solve the problem: https://bit.ly/3g1Kguh