| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 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 |
Atcoder Beginner Contest 51 — B — Sum of Three Integers
Hello everyone!
Today I was trying to solve ABC-51 Problem B. link to problem....
The editorial mentions a O(k^2) solution by looping through all possible values of x and y and figuring if a valid z exists for that x and y.
This solution had passed because the limits were not very tight. I was curious to know if there exists a faster way to solve this problem if the constraints are big!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
Mister_Rainbow | 2021-08-05 20:20:41 | 526 | Initial revision (published) |
