When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

harshil's blog

By harshil, history, 7 years ago, In English

Hi everyone!

I would like to invite you to participate in April Clash at HackerEarth. The contest is scheduled to start at April 22, 2300 hrs IST. The contest will last for 24 hours so everyone should be able to find some time to comfortably participate.

There will be six tasks in the 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 compared to the current best solution.

architrai, vedaanta, akshay_miterani, k_sudharsan,me (harshil) and Abhinav Gupta are the authors of this problemset. The testing was done by me (harshil), Xsquare and Arterm

I hope that everyone from beginners to experienced contestants will be able to find some problem that challenges and interests them. In case you find all problems too easy there is always the approximate challenge to tackle.

As always, r3gz3n was a great help, and I would like to thank him for taking care of all the technical aspects of contest preparation.

While problem solving is rewarding enough on its own, there will be some added incentive for you to do well.

Top5 of leaderboard will 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 everyone — hope to see you at the top of the leaderboard.

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

»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

The contest is live. See you on the leaderboard.

  • »
    »
    7 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    How fast are the hackerearth servers? Operations per second?

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

Please upload the editorials.

  • »
    »
    7 years ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    Some hints related to each problem. This can give you basic ideas to initiate the thinking process.

    Simple Tree
    Traditional Array
    Tree and ktuples
    Happy and Sum
    Bitwise OR
»
7 years ago, # |
  Vote: I like it +28 Vote: I do not like it
  1. Is there any faster solution for Happy and Sum?
  2. If the answer to 1 is no, what makes them think this is a good problem?