zorro_'s blog

By zorro_, 8 years ago, In English

While scrolling down through the leader board of CodeAgon 2017, I found these top 10 performers to be extraordinary.

Submission time of 4th and 6th problem


Submission time of 5th and 6th problem


Submission time of 4th and 5th problem


There is a possibility that they might have written the code but couldn't submit because of poor internet connection and later submitted both codes together or they had solved the exact same problem before and had prewritten code.

The first scenario is very rare and 3 performers from top 10 on the leaderboard will suffer the same in the same contest is just indigestible and even if someone had solved the exact same problem before, it would take some time to read and recognise that they have solved it already and it will take few more seconds to search their old codes. But I think codeAgon problems were unique, or even if it wasn't then the author will make at least the problem statement or input-output formats different which makes it difficult to solve within few seconds.

But still, I can't say that they solved it in groups and are cheaters because there might be some other possibilities which I am not able to think.So I request them (I guess you have recognised yourself) to please explain how they did it. :)

Full text and comments »

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

By zorro_, 8 years ago, In English

Easy Money problem from HackerEarth Collegiate Cup Second Elimination round simplified to compute (2^(2^n))-1 with modulus 1e9+7.

To compute (2^(2^n))%mod, where mod = 1e9+7 and 1≤ n ≤10^18
author solution:
ans = power(2, n, mod -1)
ans = power(2, ans, mod)

Can someone please explain why mod -1 is taken ?

Full text and comments »

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