HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.com/contest/243/problem/A
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.com/contest/243/problem/A
Name |
---|
For each R, there are at most log(106) distinct values of F(L, R). For k-th bit, we find
max(i | i <= R and (bit k in a[i] = 1))
. These will be all possible values of L.Can you give a little bit more information?
Did you read this?