FZU2105 Digits Count 线段树 区间运算包括与或异或

    Given N integers A={A[0],A[1],...,A[N-1]}. Here we have some operations:
    
    Operation 1: AND opn L R
    
    Here opn, L and R are integers.
    
    For L≤i≤R, we do A[i]=A[i] AND opn (here "AND" is bitwise operation).
    
    Operation 2: OR opn L R
    
    Here opn, L and R are integers.
    
    For L≤i≤R, we do A[i]=A[i] OR opn (here "OR" is bitwise operation).
    
    Operation 3: XOR opn L R
    
    Here opn, L and R are integers.
    
    For L≤i≤R, we do A[i]=A[i] XOR opn (here "XOR" is bitwise operation).