Mr. W have a sequence A with length N. F(l,r)=Al&Al+1&...&ArF(l,r) = A_l&A_{l+1}&...&A_rF(l,r)=Al&Al+1&...&Ar SetS(l,r)={F(a,b)∣min(l,r)≤a≤b≤max(l,r)}S(l,r) = { F(a,b) | minleq a leq b leq max }S(l,r)={F(a,b)∣min(l,r)≤a≤b≤max(l,r)} Mr.W makes Q queries. For each query he wants to know the size of S(L,R) for given L, R. L, R will not be given directly. He will give you L' and R'. L=%N+1L = % N + 1L=%N+1 R=%N+1R = % N + 1R=%N+1 ⊕oplus⊕means XOR. Lastans donates the answer of last query. It's zero at the beginning.
Mr. W have a sequence A with length N. F(l,r)=Al&Al+1&...&ArF(l,r) = A_l&A_{l+1}&...&A_rF(l,r)=Al&Al+1&...&Ar Set S(l,r)={F(a,b) ∣min(l,r)≤a≤b≤max(l,r)}S(l,r) = { F(a,b) | min(l, r)leq a leq b leq max(l, r) }S(l,r)={F(a,b) ∣min(l,r)≤a≤b≤max(l,r)} Mr.W makes Q queries. For each query he wants to know the size of S(L,R) for given L, R. L, R will not be given directly. He will give you L' and R'. L=(L′⊕lastans)%N+1L = (L' oplus lastans) % N + 1L=(L′⊕lastans)%N+1 R=(R′⊕lastans)%N+1R = (R' oplus lastans) % N + 1R=(R′⊕lastans)%N+1 ⊕oplus⊕ means XOR. Lastans donates the answer of last query. It's zero at the beginning.
（图片来源网络，侵删）
