Your text to link here...Anyone solved this one??
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
4 дня
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 20.11.2024 02:12:19 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
...which one?
Auto comment: topic has been updated by ankit_18 (previous revision, new revision, compare).
Your link in the original post is broken :(
You can solve that problem using the Chinese Remainder Theorem. You want to find the first time they collide x where:
Once you have this x, you can add the LCM of m and a to x until it is >= max(n, k). (you can math the second part out to solve it in O(1), plus CRT stuff)
Thanks Can u explain it more in psuedo code format please??
No man, I'm not going to write out psuedocode that solves the Chinese remainder theorem for you after I just gave you a link to learn it if you won't even fix the link on your question.
Here is a good youtube tutorial which helped me learn it, if you struggle reading through the Wikipedia article.
If what I wrote still doesn't make sense after you understand CRT, then this is probably a little bit too difficult of a problem for you to be solving at the moment. It might be more helpful to practice on easier problems until you are a bit more comfortable on implementation and then come back to this in a few weeks or so.
Yes you r ri8..I should solve the easier problem first btw thanks for ur time