lucky_21's blog

By lucky_21, history, 4 years ago, In English

Hello everyone!

Another long and exciting contest is here, December Circuits '21, with 8 amazing problems, should be solved in 7 days. The contest will start at Wednesday, 15th December, 21:30 IST (You can check your timezone here). Note the unusual start time.

The problems are prepared by me, Kritagya krikti Agarwal and Ali AliTavassoly Tavassoly.

Also huge thanks to Arpa for coordinating and testing the round.

To make the challenge more interesting, we will add problems to the contest in this order:

  • Day 0: Problem 1, Problem 2, Problem 3
  • Day 1: Problem 4, Problem 5
  • Day 4: Problem 6, Problem 7
  • Day 6: Problem 8

As usual, here are the prizes for the top three contestants:

  • $100 Amazon gift card
  • $75 Amazon gift card
  • $50 Amazon gift card

Hope to see you on the leaderboard!

Good luck everybody! Hope you all gain a positive rating Δ in this round!

  • Vote: I like it
  • +13
  • Vote: I do not like it

»
4 years ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

Auto comment: topic has been updated by lucky_21 (previous revision, new revision, compare).

»
4 years ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

Great, but please don't have wrong checker this time, i.e. Oct P0 and Nov P6.

»
4 years ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

The First Problem The Smallest Path was a repeated one (taken from SPOJ with a little change). The Standard Application of Persistent Segment Tree.

SPOJ Problem:- Problem Link Check this blog:- Blog Explaining Solution