https://www.codechef.com/problems/CHN16H
My observations:
f(2s, 2x) = f(s, x) if
f(2s, 2x) = 3f(s - 1, x) if
f(2s + 1, 2x + 1) = 3f(s, x) if
f(2s + 1, 2x + 1) = f(s - 1, x) if
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
https://www.codechef.com/problems/CHN16H
My observations:
f(2s, 2x) = f(s, x) if
f(2s, 2x) = 3f(s - 1, x) if
f(2s + 1, 2x + 1) = 3f(s, x) if
f(2s + 1, 2x + 1) = f(s - 1, x) if
Название |
---|
I did not see the question. Going by your recurrence. This recurrence can be calculated in poly logarithmic time if you do it naively.
It is easy to compute f(a,b) for some a, b in logarithmic time but the problem is to compute sum f(ia, ib) for all i <= n. a,b <= 30, n <= 10^12.