Function test

templates/binary-index-tree.cpp:75–92

}

void test(){
    int n = 100;
    std::vector<int> v(n);

    for(int i=0; i<n; i++){
        v[i] = i+1;
    }

    BinaryIndexedTree b(v);
    for(int i=0; i<100; i++){
        int q = i+1;
        int x = b.Query(q);
        printf("query %d %d\n", q, x);

        x = b.SumRange(q, q+1);
        printf("sum %d %d\n", q, x);
    }
}

int main()
{