Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link ×

I_love_Tanya_Romanova's blog

By I_love_Tanya_Romanova, 4 years ago, In English,

Hello everyone!

I want to invite you to participate in July Clash at HackerEarth. Contest is scheduled on July, 9. Contest duration is 24 hours, so there should be some comfortable time for every timezone :)

There will be six tasks in a problemset. Five of them are standard algorithmic problems with partial solutions allowed — you get points for every test that your solution passed. And the last task is an approximate problem — your score for this task depends on how good your solution is comparing to current best solution.

lewin is author of this problemset. He is experienced contestant and experienced setter as well, you can check his previous contests to know what to expect :)

I was working on this contest as a tester, and I enjoyed solving given problems a lot — I hope you'll have same feeling :) I hope that some tasks will be not too hard for beginners (don't give up and show your best with partial scoring — even very naive solution may give you some decent points; and 24 hours should be enough for you to read all problems and find some tasks which you can solve) while some tasks are challenging enough to make this contest interesting for more experienced contestants. Each problem will have subtasks mentioned, so you can figure out how much your partial solution should get for sure before even implementing it ;) Also I want to thank belowthebelt for handling all technical aspects of contest preparation.

As usual, here is one more reason for you to participate in this contest:

Top5 of leaderboard will also receive some nice prizes:

  1. $100 Amazon gift card + HackerEarth T-shirt
  2. $75 Amazon gift card + HackerEarth T-shirt
  3. $50 Amazon gift card + HackerEarth T-shirt
  4. HackerEarth T-shirt
  5. HackerEarth T-shirt

Good luck to everybody — I hope to see you at the scoreboard :)

Upd. Contest has ended, thanks to everyone for participating! Congratulations to winners:

1) anta

2) ecnerwal

3) LayCurse

4) y0105w49

5) cjtoribio

All solutions are public, solutions by setter and tester are also available now. Editorials for most of the problems have been published; in a few days remaining editorials will be added / published editorials will be improved and also updated with some alternative approaches from contestants (some of them look quite interesting).

  • Vote: I like it
  • +48
  • Vote: I do not like it

4 years ago, # |
  Vote: I like it +9 Vote: I do not like it

Bump. This is starting in half an hour.

4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How do I get know my rating changes? It is not displayed in my profile? Also, in the rating section, there is no option to search?

4 years ago, # |
  Vote: I like it +28 Vote: I do not like it

For the approximate problem, you can actually solve it exactly when k = n-1 :). If you looked at the test data generation, you could have ran it locally and noticed that over 90% of test data will have k=n-1. Unfortunately, it seemed no one got this solution, but you can try to solve this exactly for an exercise now that you know that a solution exists.

4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What is the solution to Extended Expedition?

4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Off-topic: If anyone's interesting in setting the problem-set for August Clash, please drop me a message!