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 :)
Скоро Codeforces Round 1133 (Div. 1, Div. 2)! Регистрация здесь.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 07.11.2026 07:50:21 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Just a reminder, contest starts in about 9 hrs!
I сouldn't find how long it will take, could you?
It written, 4 days.
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. :)
Congrats.
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 :)
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?
My soultion for K-N-R is
too http://pastebin.com/itRUQiJt
It'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.