| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | atcoder_official | 163 |
| 3 | Um_nik | 162 |
| 3 | maomao90 | 162 |
| 5 | adamant | 157 |
| 5 | -is-this-fft- | 157 |
| 5 | djm03178 | 157 |
| 8 | awoo | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
I need help solving problems about Binary Search
I am facing this problem and don't know how to avoid TLE. Can someone please give me an algorithm hint for this problem? I already know the O(n^2) way.
We have n numbers which are the lengths of the sticks. Find the number of unique triangles that can be formed from the given n sticks. Unique triangles are understood as triangles that do not have a pair of 3 identical sides.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
hanoi11minh_nh | 2024-12-12 05:57:22 | 36 | Tiny change: 'Thank you.' -> 'Thank you.\nNote: I can solve it know, thanks.' | |
| en2 |
|
hanoi11minh_nh | 2024-12-11 19:24:12 | 53 | ||
| en1 |
|
hanoi11minh_nh | 2024-12-11 19:08:40 | 524 | Initial revision (published) |
