Code Monk: Heaps

Revision en3, by mathturbator, 2017-02-08 17:57:03

Hello, Codeforces community!

I want to invite you guys to another Code Monk contest which is later today. The contest is based on Heaps, and its basic usage.

The link to the tutorial: https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/tutorial/

The link to the contest: https://www.hackerearth.com/challenge/competitive/code-monk-heaps-and-priority-queues-1/

belowthebelt, prat33k, r3gz3n, MazzForces and trytolearn have contributed towards the making of the contest, creating problems, testing them and writing editorials and with the general feedback and management of the contest. They've worked extremely hard on making this contest a unique learning experience for people who want to learn the concepts of heaps and understand its working and structure.

The problem set consists of 5 algorithmic tasks with partial solutions allowed — you get points for every test that your solution passes. Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!

Good luck to everyone, and have fun! :)

Tags codemonk, heaps, learning, glhf

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English mathturbator 2017-02-14 12:54:42 6 Tiny change: 'vs Akhil\n2) Umang' -> 'vs Akhil\n\n2) Umang'
en6 English mathturbator 2017-02-14 12:53:54 154
en5 English mathturbator 2017-02-08 18:01:18 281 (published)
en4 English mathturbator 2017-02-08 17:57:30 2 Tiny change: '-02-08T09:00:00&p1=64' -> '-02-08T09:30:00&p1=64'
en3 English mathturbator 2017-02-08 17:57:03 2 Tiny change: '-02-08T09:30:00&p1=64' -> '-02-08T09:00:00&p1=64' (saved to drafts)
en2 English mathturbator 2017-02-08 10:22:26 343
en1 English mathturbator 2017-02-08 10:12:45 943 Initial revision (published)