Invitation to CodeChef April Lunchtime 2021

[radoslav192]

We invite you to participate in CodeChef’s April Lunchtime in collaboration with Dream In Code - IIIT, Lucknow, this Friday, 30th April.

Time: 7:30 PM - 10:30 PM IST.

The April Lunchtime is going to have Amazon as the official contest recruiter! Amazon is hiring for Software Development Engineer 1, Software Development Engineer 2, and Support Engineer roles for its fast-paced environment.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef’s contests, you can share them here.

Joining me on the problem setting panel are:

• Setters: Anshul skywalker_ Garg, Sambhav sam12346578 Jain, Milos losmi247 Puric, Chahat agrawall117 Agrawal, Evgeny karpovich, Yogesh yk_ax Kumar, Karanjeet zankanotachi Talwar, Daanish daanish_adm Mahajan

• Testers: Taranpreet taran_1407 Singh & Daanish daanish_adm Mahajan

• Statement Verifier: Riley monogon Borgard

• Editorialist: Taranpreet taran_1407 Singh

• Admins: Radoslav radoslav192 Dimitrov, Jatin jtnydv25 Yadav

• Coordinator/Admin: Alex um_nik Danilyuk

• Video Editorialists: Chirayu chirayu_98 Jain, Prachi prachi16121996 Agarwal, Darshan darshancool25 Lokhande, Yashodhan zappelectro Agnihotri, Bharat singlabharat Singla, Shivam whitemagic Bohra, Aryan aryanag_adm Agarwala, Radoslav radoslav192 Dimitrov, Meet kaun_meet Singh Gambhir

Prizes:

The winners will receive certificates and CodeChef laddus with which they can claim cool CodeChef goodies. Know more here.

The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.

Good Luck!

Hope to see you participating!!

Happy Programming!!

[tehlka]

At what rank in div1 and after how long , can we expect a call from amazon?

[cubefreak777]

I guess div-1 peeps can go to sleep early today after solving 1.5 problems .

[taran_1407]

XX: The number of ways are the first 1+k coefficients of generating function of e^(bx)*(1+e^(ax))^n which can be computed in O(K∗log(K))O(K∗log(K)) using newton’s method.

ALLGRAPH: For all nodes appearing as endpoint of atleast 1 edge, we assume the edges are undirected, and try to run dijkstra from each node. Most of the outgoing edges from a node have same weight, we try to handle them together using segment tree to support queries of extracting min and updating min.

IMAT: Combination of Knapsack DP and Meet in the middle based on N and M is intended solution. Specifically, Meet in the middle approach fails for M>40M>40 where knapsack works. This editorial will be out soon.

The editorials for rest of the problems are out. Hope you guys enjoyed it.

[akshitm16]

Congrats⭐

[cubefreak777]

Thanks! just a lucky strike tbh