DimmyT's blog

Invitation to HackerEarth DSA Coding Contest September '21
By DimmyT, 3 years ago, In English

As-salamu alaykum, Codeforces! (Peace, Codeforces!)

I am glad to invite you to HackerEarth September DSA Contest. The contest is rated and will start 11 September at 10:00 AM BDT. In contest will be given 3 problems to solve in 90 minutes. All the problems are prepared by me, and I hope that you will like them.

I would like to thank Arpa for coordinating and testing the round. Also, I would like to thank Arpa calmness...

As always, thanks to MikeMirzayanov for polygon platform.

Good luck and do not give up!

Final UPD: Thanks to Arpa for helping with updating standings!

Here top:

  1. joshua269
  2. invincible_0
  3. timothygao8710
  • Vote: I like it
  • +19
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it +13 Vote: I do not like it

I think you should mention the start time and date as well in announcement , though it's visible when we click on the link .

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

Any reason why you preferred to host it in HackerEarth and not in codeforces?

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

    I have only 3 problems for Codeforces you need at least 5 for div2

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

Actually, 2nd problem is solved by 'Anurag Srivastava (invincible_0)' (Currently, rank 49) and 3rd problem is solved by 'Joshua Chen (joshua269)' (Currently, rank 2). You can check the leaderboard.

You will see their individual problem scores as 100 in 2nd and 3rd problem respectively.

The thing is, the leaderboard isn't correctly refreshed from the server end. That's it. It nearly always happens in Hackerearth's Short Contests! I would genuinely request the Hackerearth's developers to look into this Leaderboard refresh issue.

It has happened with me so many times, and it's only updated after I mail them.

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

    Oh! I see... I thought that they upsolved problems afterward

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

Hello , for the second problem in Hackerearth DSA, I have a "?"

Why there will only be log(x) distinct values ? We have '0'. We xor it with different numbers 'x' such that 1<=x<=100000, no matter how many times this operation is performed...Number of distinct values will be log(x)...Why??

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

    no... do you know linear algebra? I meant that for each position we can calculate basis from queries that can be applied on. Basis can be found by Gauss elimination so on the basis there are can be at most $$$log(x)$$$ different values, but if we applied subset of this basis there can be $$$2^{size of basis}$$$ different values.

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

How many days will it take to update the leaderboard of a short contest by Hackerearth? Are the developers sleeping since morning ?

→ Reply