I have tried solving this http://www.codechef.com/problems/CHEFD/ problem using sqrt decomposition technique,but im getting AC for some cases and wrong answer for some cases......Can anyone discuss your idea using sqrt decomposition method for this problem,thanks......
→ Обратите внимание
До соревнования
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
34:34:24
Зарегистрироваться »
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
34:34:24
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 2 | adamant | 163 |
| 4 | maroonrk | 152 |
| 5 | nor | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 147 |
| 7 | atcoder_official | 147 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 29.06.2024 07:00:38 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by rahulnagurtha (previous revision, new revision, compare).
Do you already read the editorial?
Link: http://discuss.codechef.com/questions/51848/chefd-editorial
Hey ! I solved it :)
There is actually a cute way to solve the problem by processing the queries in reverse order and using segment trees/bit to keep how many times a value has been divided with on a certain position.
Auto comment: topic has been updated by rahulnagurtha (previous revision, new revision, compare).