Thanks for participating; we hope you enjoyed the tasks! Look at the bottom of this post for some more challenges.
Feel free to ask in the comment if you have any question. If you have a different solution from ours, share it too. :D
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Thanks for participating; we hope you enjoyed the tasks! Look at the bottom of this post for some more challenges.
Feel free to ask in the comment if you have any question. If you have a different solution from ours, share it too. :D
Can you do better than ?
There's a nice solution, but you could also use a Voronoi diagram for an runtime too!
Develop from our approach to solve the task in linear time!
Solve the task when m can be up to 105!
Hi everyone!
HackerEarth hosts its Easy contests every month, and now is the time for September Easy '18. Yasssssss!!!
September Easy '18 is an algorithmic programming competition where you will be given 3 hours to solve 6 tasks of varying difficulties. All tasks have partial scoring, so you could probably get a lot of points even though you don't have a full solution.
The tasks are authored by me (zoomswk) and tested by Errichto. Special thanks to MazzForces for making this contest possible.
The contest is rated for all, and there are prizes to be won! Check the contest page for more details.
We have worked hard to make the tasks interesting, so we really hope you won't miss it. We believe that you'll find some tasks interesting!
Good luck and have fun! Hope to see you there.
P.S. Don't forget to read all problems. :)
========
Congratulations to the winners!
I hope you all have enjoyed the contest. You may discuss the problems now. Any feedback is welcome! :D
Hello everyone!
I would like to invite you to participate in HackerEarth September Circuits '17. It's a long contest that has started on September 22, 2017, 21:00 IST. The contest will run for 10 days, until October 2, 2017, 21:00 IST.
The problemset consists of 7 traditional algorithmic tasks of various difficulties and 1 approximate problem. For traditional algorithmic tasks, you will receive points for every test case your solution passes — so you can get some points with partial solutions as well. For the approximation task, your score depends on the best solution in the contest so far. Check contest page for more details about in-contest schedule and rules.
Problems are prepared by karan_thakkar, Apptica, r3gz3n, AlexandruValeanu, and me. KuchumovIlya is the tester of the problemset.
As usual, there will be some prizes for the top five competitors:
Good luck to everyone, and I hope to see you at the contest :)
Official Implementation: http://ideone.com/jsXSst
===
Official Implementation: http://ideone.com/YD7s4S
NOTE: If you get TLE, use faster input methods. For example, use scanf instead of cin.
===
Official Implementation: http://ideone.com/B9pjyi
NOTE: If you get TLE, use faster input methods. For example, use scanf instead of cin.
===
Official Implementation: http://ideone.com/nlPVW0
===
Official Implementation: http://ideone.com/cwP55b
===
Official Implementation: http://ideone.com/FfnJyp
===
Feel free to ask any questions below. It's hard to write an editorial that satisfies the need of everyone. I hope you'll enjoy solving the problems :)
Hi, everyone!
Unfortunately, the round was moved two hours later. Sorry for the inconvenience.
It is my honor to announce that the Codeforces Round #408 rated for the second division is going to take place tomorrow at 16:35 UTC. As usual, participants from the first division will be able to participate out of competition.
As the author of this contest, I (zoomswk) would like to thank PoomrokC, nisaruj, and Phoom for testing the problems, KAN and netman for their help in contest preparation, and MikeMirzayanov for the awesome Codeforces and Polygon platforms. Cute graphics in this round are designed by my friend Chonphuech Sripongtanakul, so thanks to her also!
In this round, you will be given 6 problems and 2 hours to solve them. Zane the Wizard, along with his puppy and his crush, will be asking for your help. It is advised that you read all problems and read them carefully.
As per tradition, the scoring distribution will be announced later.
I hope you will enjoy the problems.
Good luck! :D
UPD: The scoring distribution is 500-750-1000-1500-2000-2500.
UPD: The round has ended. Thanks everyone for participating. I'm deeply sorry that the problems turn out to be way harder than I expected. Please stay tuned for the editorial. T_T
UPD: The system testing is complete. Congratulations to the winners!
Div. 2 Winners
Div. 1 Winners
I sincerely apologize that slow input/output methods caused so many TLEs. Unfortunately, it is not possible to rejudge the submissions nor increase the time limit at this point. This is my fault, and I'm terribly sorry. I was not aware of this because my solutions run in < 500 ms of time limit in all problems. I hope you understand.
The editorial will be published in a few minutes, and I'll update this post when it's available.
UPD: The editorial is ready!
Name |
---|