r3gz3n's blog

Invitation to HackerEarth February Circuits '17
By r3gz3n, history, 8 years ago, In English

All you need is love. But some algorithmic problems now and then doesn't hurt.

Hello everyone!

I would like to invite you to participate in HackerEarth February Circuits '17. It's a long contest that will start on February, 17, 21:00 IST (check your timezone). Contest will run for 9 days.

The participants will be challenged with 7 traditional algorithmic tasks and 1 approximate problem of varying difficulty levels in a duration of 9 days. 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. Here is the detailed time line of the challenge,

  • Day-0 : Problem-1 (Easy) , Problem-2 (Easy-Medium), Approximate
  • Day-2 : Problem-3 (Easy-Medium) , Problem-4 (Medium)
  • Day-4 : Problem-5 (Medium-Hard) , Problem-6 (Hard)
  • Day-6 : Problem-7 (Hard)
  • Day-7 : Challenge Ends

I am the admin of the contest. I'd like to thanks KuchumovIlya for preparing the tasks and niyaznigmatul for testing them and MikeMirzayanov for creating Polygon.

The contest will be RATED.

Happy Coding :)

UPD1: First Set is live.
UPD2: Second Set is live.
UPD3: Third Set is live.
UPD4: Final Set is live.

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

Comments Comments (11)
| Write comment?
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

"MikeMirzayanov for creating Polygon" :/

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +53 Vote: I do not like it

    We used Polygon for creating the tasks.

    → Reply
»
8 years ago, # |
  Vote: I like it +8 Vote: I do not like it

If I'm correct, the previous January Circuits is not rated due to an issue with a certain problem. Hopefully the same mistake will not occur again :)

→ Reply
»
8 years ago, # |
  Vote: I like it +11 Vote: I do not like it

One hour to go! All the best. See you on the leaderboard :)

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by r3gz3n (previous revision, new revision, compare).

→ Reply
»
8 years ago, # |
  Vote: I like it +19 Vote: I do not like it

Will there be editorials?

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

What is the idea for minimum distance problem from february circuits?

→ Reply