CodeDrills Beta Contest #3 [Team Contest] Announcement

Hello everyone!
CodeDrills will be hosting its first team contest CodeDrills Beta Contest #3 on Sunday, 7th March, 2021 9:00 PM — 10:30 PM IST. There will be 4 or 5 problems to be solved in 1.5 hours.

Contest Details

You will need to create a team on the contest page in order to participate. Team size can be upto 3. While creating the team, add the registered emails of other users to invite them to join your team. They will get an invite email, ask them to accept. For more details on team registration, refer this guide.

I hope you will enjoy solving the problems.
Hope to see you participating!!!

Thanks everyone for participating. Editorials are out for all the problems. Solutions wont be visible if you are not logged in.

Congratulations to the winners!

  1. Unbreakable — Nishant nishant403 Shah, Taranpreet Discombobulated Singh
  2. Onyan — Nishank IceKnight1093 Suresh
  3. TodoMihnator — Alexandru atodo Todoran

Note :
For practice, users are not able to submit the solutions on contest page, we will fix it.
All problems after the contest will be added to competitive section. So you can still submit from here.
Attaching all problem links for practice -

  1. New Virus Spread
  2. Stack of Boxes
  3. Relics Collection
  4. Phone and Chargers
  5. Expected Empty Chess Squares

Reminder to register for the contest! You wont be able to register after the contest starts hence please register before 9 PM IST.

Reminder: Contest starts in 30 minutes.

We have rejudged “Expected Empty Chess Squares” problem as it had some test issues and 1 wrong submission has now got accepted. Apologies for the mistake.

1 Like

In “Expected Empty Chess Squares”, how is the clipping k at 331/330 logic working ? what is the rationale behind it ?

This was just a simulation problem, for a fixed n, if we increase k, the expected value converges to a particular constant. For odd and even values the convergence is different, hence that condition.

1 Like