HOW TO SOLVE THE INEQUALITY i*(i + 1) <= n such that i is maximum possible in O(1) time complexity.is their exist any method.
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
HOW TO SOLVE THE INEQUALITY i*(i + 1) <= n such that i is maximum possible in O(1) time complexity.is their exist any method.
Name |
---|
This is the one I can think of. Solve $$$i^{2}+i-n=0$$$
So just take floor(sol) from the previous equation.
The problem is that solution involves computing square root which is not O(1).
yeah that is the problem, i can find it in sqrt complexity but i guess constant complexity is not possible
Computing the square root of a number is actually very close close to O(1) !
I don't know the complexity exactly but it is described here : https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations