| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Hey guys, i wanted to know how i can optimise my solution for Code Forces round #655 div2. problem B
86827890 problem:https://codeforces.me/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 \lt 2 \cdot 10^8$$$, passes very well.
if complexity is $$$O(n)$$$: $$$10^9 \gt 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.