| # | User | Rating |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 164 |
| 3 | awoo | 163 |
| 4 | TheScrasse | 156 |
| 5 | nor | 153 |
| 6 | maroonrk | 152 |
| 6 | -is-this-fft- | 152 |
| 8 | Petr | 145 |
| 9 | orz | 144 |
| 9 | pajenegod | 144 |
TLE in GNU C11, AC in GNU G++ 14
I was wondering why the exact same code
https://codeforces.com/contest/833/submission/53432006
gets a TLE on test 8 when submitted in C11 but
https://codeforces.com/contest/833/submission/53431981
gets AC when submitted in G++14. Does the C++ compiler optimize the operations or something? If I'm not wrong the complexity of this solution should be O(n log max(a*b)) (I assumed the complexity of cuberoot is log n, I don't actually know what it is).
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Hyperlink_Blocked | 2019-04-27 20:12:22 | 8 | Initial revision | |
| en1 |
|
Hyperlink_Blocked | 2019-04-27 20:02:40 | 495 | Initial revision (published) |
