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

Автор shashank21j, 10 лет назад, По-английски

Hi!

Ad Infinitum is back with 10th Edition, a monthly contest restricted to mathematics domain, held on HackerRank.

Register at https://www.hackerrank.com/infinitum10
The contest commences on 20th February 15:30 UTC. You are allowed to enter the contest anytime, for tie breaking the timer will start when you view the first challenge, which allows you to start late at your convenience, but once started try to finish as fast as possible to be on top of the leaderboard :)

It's a 2 days contest with 8 problems (3 Easy(Tutorial), 3 Medium, 2 Hard)
Scoring Distribution: 20 20 20 40 60 80 100 120

Top 10 on leaderboard gets Cool HackerRank T shirt,
Special prizes and Job Opportunities for Indian participants.

Contributers
kevinsogo
bayleef
darkshadows
ma5termind

Detailed editorials will be available by the end of contest :) I suggest you to try all challenges and at the end of contest understand the solutions.

GL&HF

  • Проголосовать: нравится
  • +26
  • Проголосовать: не нравится

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

Has anybody competed in this earlier? Is it a good contest?

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

    From my experience — sometimes problems are more or less standard ACM tasks focused on math (like last task from Ad Infinitum 9, which I solved with pretty standard ACM technique), in other cases you'll face completely different tasks — where OEIS and long staring at results of brute-force solution is only way for me to find a solution, and even after reading an editorial it still looks like some math magic :) And for both types — there are lot of contestants who like them.

    So I would say — yes, I competed in it few times before, and it is a good contest, try it :)

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

Is there some system of reminders about Ad Infinitums? I participated 5 times in a row, but I think that I didn't miss any of them because of your blogs on CF and it can be the case that someday I will just miss them.

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

Awesome problems! Thank you!