| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
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://mirror.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) |
