Hello, Codeforces community!↵
↵
Introducing HackerEarth Code Monk, contest for which is [later today]((http://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeMonk%20Heaps%20%2717&iso=2017-02-08T09:30:00&p1=64)). The problems will be based on the basics of computer science concepts. Every week, we will release the tutorials, on which the Code Monk challenge will be based on. ↵
↵
OPENS AT:Feb 08, 09:00 PM IST.↵
↵
CLOSES ON:Feb 09, 12:00 AM IST.↵
↵
↵
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/↵
↵
[user:belowthebelt,2017-02-08], [user:prat33k,2017-02-08], [user:r3gz3n,2017-02-08], [user:_AJ_,2017-02-08] and [user:trytolearn,2017-02-08] 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! :)↵
↵
UPD:↵
↵
Winners of Code Monk (Heaps and Priority Queues) are:↵
↵
1) Gvs Akhil↵
↵
2) Umang Upadhyay↵
↵
3) Vaibhav Bansal↵
↵
Congrats to all the winners. :D
↵
Introducing HackerEarth Code Monk, contest for which is [later today]((http://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeMonk%20Heaps%20%2717&iso=2017-02-08T09:30:00&p1=64)). The problems will be based on the basics of computer science concepts. Every week, we will release the tutorials, on which the Code Monk challenge will be based on. ↵
↵
OPENS AT:Feb 08, 09:00 PM IST.↵
↵
CLOSES ON:Feb 09, 12:00 AM IST.↵
↵
↵
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/↵
↵
[user:belowthebelt,2017-02-08], [user:prat33k,2017-02-08], [user:r3gz3n,2017-02-08], [user:_AJ_,2017-02-08] and [user:trytolearn,2017-02-08] 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! :)↵
↵
UPD:↵
↵
Winners of Code Monk (Heaps and Priority Queues) are:↵
↵
1) Gvs Akhil↵
↵
2) Umang Upadhyay↵
↵
3) Vaibhav Bansal↵
↵
Congrats to all the winners. :D
