Hello Codeforces Community!
I invite you all to join HackerRank's HourRank 24 on November 2, 2017, at 20:30 IST.
There will be four tasks in the round and one hour for you to solve them. The contest will be rated and the top ten contestants will receive HackerRank T-shirts!
The problems are prepared by anveshi and tested by Stomach_ache, qoo2p5 and me. There are four problems this time instead of three. I suggest you read all of them. I hope you'll like them!
Good luck and Happy Coding!
Auto comment: topic has been updated by kevinsogo (previous revision, new revision, compare).
The website is not loading for me :/
Why the heck does tourist decide to write contest when I'm getting tshirt -_- I got on 11 th twice on hourrank and both of times he was first ! WTF -_-
In the problem wire removal ,Solution 2 mentions "Since i gets disconnected from the root precisely when one of these edges is removed, and since these events are independent" ... How are they independent ???. One edge affects all the downwards.How???
I think they are independent because problem statement says:
Given that exactly one of the wires randomly breaks, find the expected number of vertices still connected to the ceiling.
Not a very good performance for me, but, hey, screencast!
Weak Test cases for the 3rd question.
see this solution
My logic is also same but i got TLE because i have used long long int and after the contest, i changed long long int to int and got AC!