Hi everyone,

I would like to invite you to participate in HackerEarth's July Easy'19. The contest will start at 04:00 UTC, July 07, 2019

The problems are prepared by me, FastestFinger, Danylo99 and MazzForces and tested by Arpa. I hope you'll find the problemset to be interesting.

You will be given 6 algorithmic problems to solve in 3 hours. Partial scoring will be used (you get points for passing each test case). Although the contest is targeted towards beginners, we hope even experienced problem-solvers find one or two problems to be interesting. The contest is rated and prizes will be awarded to the top 3 beginners (i.e. programmers with a rating of 1600 or less before the challenge starts) — $75, $50 and $25 Amazon gift cards respectively. In addition, there are T-shirts for the top 10.

Good luck & high ratings!

Upd: Contest starts in 30 minutes!

Upd2: Contest has ended.

Winners:

1. Deemo

2. neal

3. chemthan

Congratulations to winners.

Hi everyone!

I would like to invite you to participate in HourStorm #10. The contest will start at 16:00 UTC,April 13, 2019

It's a 1-hour competition with 3 traditional (but nice) algorithmic tasks. You will receive points for every test case your solution passes, so you can get some points with partial solutions as well. Check the contest page for more details about contest schedule and rules.

The problems have been prepared by me and FastestFinger, helped by anil9717 and tested by Arpa. There are prizes for top 3 contestants: $75, $50 and $25 Amazon gift cards respectively. In addition, the top 5 will win HackerEarth t-shirts.

Good Luck and High Ratings!

Upd: Round begins in less that 22 hours!

Upd2: Round has begun. All the best!

Upd3: Round has ended. It was very exciting to watch the leaderboard towards the end with 4 people securing perfect score of 300 at 58th minute :)

Winners:

1. Gennady Korotkevich (tourist)

2. Mateusz Radecki (Radewoosh)

3. Michael Nematollahi (Deemo)

Congratulations to all the winners!

Can this be done in O(n^2) space and O(n^3) time? Please share your approach.

PROBLEM: https://code.google.com/codejam/contest/11274486/dashboard#s=p2 (JANE FLOWERSHOP)

i am getting wrong answer on large subtask. i used similar concept as binary search and went on digging near to the root of the equation using property that f(x) has a root between a and b if f(a)*f(b)<0 . it works for sample cases also. code: https://gist.github.com/ankesh007/f9e44d3cdf8ed5d8e3e218167c6272a1

please help/share approach.