### viv001's blog

By viv001, 6 years ago, ,

Hi Coders!

You are welcome to participate in the first ever math programming contest to be held by Hackerrank on March 28. For more details and registration, follow the link below :

https://www.hackerrank.com/infinitum-mar14

Happy Coding :)

• +17

 » 6 years ago, # |   +6 Just a reminder, contest starts in about 9 hrs!
 » 6 years ago, # | ← Rev. 2 →   +8 I сouldn't find how long it will take, could you?
•  » » 6 years ago, # ^ | ← Rev. 2 →   +5 It written, 4 days.
 » 6 years ago, # | ← Rev. 2 →   0 whew, i finally solved the problem Devu Vs Police! that was a lot more hard work than i thought it would be!!! PS: i will share my solution after the contest. ;)EDIT: hmm, it seems my solution is much harder to describe than i initially thought. but here is the link to my submission. i hope its not too hard to understand, but if u want more detailed explanation on anything particular u can ask me. :)
•  » » 6 years ago, # ^ | ← Rev. 3 →   0 Congrats.
•  » » 6 years ago, # ^ |   0 Could you pls provide me an idea of the solution? My solution passed only half test.PS: Also I solved the most hard problem Summing the K-N-R Series :)
•  » » » 6 years ago, # ^ | ← Rev. 5 →   0 This post might help you. You can also use x = maximum exponent in the prime factorization of n and C = φ(m) for a quick-and-dirty solution.What is your complexity for K-N-R? It took me real effort to make my solution to pass, I had to manually unroll loops and the alike. I don't think K-N-R was the hardest though, I put most work into "A very special multiple". But maybe I just used a stupid approach there. Does somebody have a rather simple solution for that?
•  » » » » 6 years ago, # ^ | ← Rev. 5 →   0 My soultion for K-N-R is too http://pastebin.com/itRUQiJtIt's was quite easy for me to find out a recursion formula on a sheet. I got 'Accepted' with the first attempt:)UPD: Thank you for link, I was close.