You are given an array of size n find number of distinct digits in the numbers in a given range ? I know how to do it with segment tree , please help me to do it with Binary indexed tree .
thanks in advance :)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
You are given an array of size n find number of distinct digits in the numbers in a given range ? I know how to do it with segment tree , please help me to do it with Binary indexed tree .
thanks in advance :)
I know how to do it with Segment tree but How to calculate range minimum query using Binary Indexed Tree.
thanks in advance!!
Given N points in the 2- D plane , find minimum radius of the circle which encloses atleast m points?
thanks in advance
Any number can be expressed as the sum of squares of four numbers according to lagrange four square theorem, i want to find all possible solution for the given number, I know a algorithm which work in O(n*root(n)), is their any more optimized algorithm ?
thanks in advance :)
-----------------
I request codeforces to organise contest on regular basis, the last 3-4 contest were organised in a rapid way, but now after those contest the next contest is after 5 days, So i request codeforces to organise contest regularly.
please MikeMirzayanov have a look over it and Thanks for the Codeforces and Polygon systems.
Thankyou
Name |
---|