| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
hallo codeforces
I have TLE in this problem C. Can I Square? in last round
with O($$$10^4\cdot\sqrt{2\cdot10^{10}}$$$)
but my friends dont got TLE with same time complexity
Can I get a re-judge for my submission ?
Or an explanation of the problem that occurred
because of skibidi
No he got TLE in system test
good joke -_-
I bet it's because you use C-style IO (print, scanf) and C++-style (cin) at the same time. Never mix two styles and use
as your friends did
And. does not worth pinging Mike)
Regardless of his solution, the other solutions have a very high complexity
239292334 this will probably tle because it's clearly > 1e9 operations
Find sum of array, check if sum is perfect square. I do not understand why you used the second loop :(
first submission & second submission for another user have same complexity but dont get TLE
I have no idea then why this happened.
This is what we're talking about