Блог пользователя viv001

Math Programming Contest on Hackerrank
Автор viv001, 10 лет назад, По-английски

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
  • Проголосовать: не нравится

»
10 лет назад, # |
  Проголосовать: нравится +6 Проголосовать: не нравится

Just a reminder, contest starts in about 9 hrs!

→ Ответить
»
10 лет назад, # |
← Rev. 2   Проголосовать: нравится +8 Проголосовать: не нравится

I сouldn't find how long it will take, could you?

→ Ответить
»
10 лет назад, # |
← 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. :)

→ Ответить
  • »
    »
    10 лет назад, # ^ |
    ← Rev. 3   Проголосовать: нравится 0 Проголосовать: не нравится

    Congrats.

    → Ответить
  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится 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 :)

    → Ответить
    • »
      »
      »
      10 лет назад, # ^ |
      ← 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?

      → Ответить