| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | 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 | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
TLE or Not
160347701 Could anybody please tell me why this code is working for below testcase :
1
100000
first String :- [aaaaaaa....till 50000 places] + [bbbbbbbb.... till 100000 places]
second String :- [bbbbbb....till 50000 places] + [aaaaaaa....till 100000 places]
According to the code and the testcase given ,the time complexity should be (N + (50000^50000)) which should give TLE then why it is not giving TLE. Would anyone like to help me out.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
sachinjaiswal | 2022-06-13 05:49:37 | 6 | Tiny change: ' + (50000^50000)) which s' -> ' + (50000^2)) which s' | |
| en1 |
|
sachinjaiswal | 2022-06-13 05:47:04 | 489 | Initial revision (published) |
