| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
Time complexity
Hi,
so far I have known that the time complexity for concatenating two strings is O(n). So
while (a.length() < b.length()) a = "0" + a;
is O(n^2). But it still passed the TL: http://codeforces.com/contest/1066/submission/44198754
I am wondering why it passed. Could anyone help me?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
EternalFire | 2018-10-13 11:00:44 | 4 | Tiny change: 'Hi,\nSo far I ha' -> 'Hi,\n\nso far I ha' | |
| en2 |
|
EternalFire | 2018-10-13 11:00:10 | 5 | ||
| en1 |
|
EternalFire | 2018-10-13 10:58:27 | 305 | Initial revision (published) |
