| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
| 10 | nor | 152 |
Hey guys, i wanted to know how i can optimise my solution for Code Forces round #655 div2. problem B
86827890 problem:https://codeforces.net/contest/1372/problem/B it says TLE on the 4th test case. Can someone please help me to find a better solution.Thanks in advance.
p.s.:sorry if this isn't how you are supposed to use blogs, i wasn't sure where to post doubts in this website.
For odd numbers you are checking till n/2 making the complexity O(n). The constraints are too high for O(n). Try doing it in O(sqrt(n))
thankyou, how will i know if the constraints are too high for my time complexity?
Suppose you know your complexity and it is something like $$$O(f(n))$$$. Take the maximum possible $$$n$$$ and calculate $$$f(n)$$$. If it is less than $$$2 \cdot 10^8$$$ it fits in 1 second (it's only a rule of thumb but in practice it works very well).
In your case maximum value of $$$n$$$ is $$$10^9$$$.
if complexity is $$$O(\sqrt{n})$$$: $$$\sqrt{10^9} \approx 31600 < 2 \cdot 10^8$$$, passes very well.
if complexity is $$$O(n)$$$: $$$10^9 > 2 \cdot 10^8$$$, won't pass unless you try very hard to squeeze it in.
Thankyou very much, the rule of thumb will help me a lot :D
There are several thousend working solutions and a tutorial
You are supposed to have a look into that resources.