Hello everyone!!
GeekHaven, the technical society of IIIT Allahabad is organizing its first open contest for the year 2020. The contest is prepared by the members of the competitive coding wing. This will be an individual contest and unrated for all and the problem set will consist of 5/6 problems of varying difficulty. If you have a knack for data structures and algorithms you will definitely like the contest.
The contest will be hosted on CodeChef and will start at 9:00 PM IST on 25th March. The contest duration will be 2.5 hrs.
Contest link: CodeInvicta
250 CodeChef laddus will be given to each of the top 3 winners.
The problems have been set and tested by Aakash Mehta — thunderbird001, Abhishek Garg — spidy7, Bhavya Girotra — pseudocoder10, Parmjeet Singh — tyler_jake, Samarth Mittal — sam_mit, Kumar Raju — Eunoia__1729
Editorials will be posted here after the contest
Hoping to see you all on the leaderboard!!
UPD — Subtasks are also included in some problems and the contest is about to begin in 15 minutes.
UPD — Thanks for the overwhelming response
Congratulations to the top 5 winners:
UPD : Link to the editorials
Divide them all
Back In 2 minutes!!
Find the XOR
Fairy Tales!!
Bring Positivity
Generous Raju
If you have any doubts regarding any editorial feel free to ask them in the comments :)
As a fellow member of Bhavya Girotra Fan club, I request u all to make Bhavya Girotra the lead problem setter
+1
Bhavya Girotra orz
Bhavya Girotra orz!
Bhavya Girotra orz!
Bhavya Girotra orz!
Bhavya Girotra orz
BCK2 was the clone of 1280C : Jeremy Bearimy
The idea was taken from an old ACM-ICPC problem (quite old like 9-10 years). But it coincidentally matches with the mentioned one.
was this contest rated?
No, it was unrated for all.
Link to tutorial?
We will post the editorials by tomorrow and the link will be updated in the blog
Is there any other approach for question FairyTale FTALES01?
means without finding bridges?
Afaik, finding bridges is the simplest approach possible. However,there may be other approaches as well.
The question requires you to find the number of animals who are on the bridge, so I think whatever you do you will be somehow finding bridges in the graph :P.
This blog uses DFS tree find bridges, I found it really interesting when I read it for the first time, read it if you would like to :)
How to solve second last problem (Bring Positivity)?
although editorial will be posted soon,but still hint is inclusion exclusion principle.
Congratulation spidy7 for becoming Master