| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | 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 |
| 9 | nor | 153 |
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.me/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) |
