Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

dario-dsa's blog

Problem with CF task
By dario-dsa, 13 years ago, In English

HI, I am having problem with figure it a fast way to solve this problem so can anyone help me?
http://codeforces.me/contest/243/problem/A

  • Vote: I like it
  • -8
  • Vote: I do not like it

»
13 years ago, hide # |
← Rev. 2  
Vote: I like it +6 Vote: I do not like it

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.

→ Reply