for(int i = 2; i <= int(1e6); i++){
for(int j = 0; j <= int(1e6); j += i){
//Here anything which takes O(1) time.....
} }
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 02.06.2024 09:28:53 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
Complexity is O(nlogn), so it will pass.
Also, you can use custom invocation to check run time.
wrong is O(1)
Notice that
j += i. So the overall complexity is $$$O(\frac{n}{1} + \frac{n}{2} + \dots + \frac{n}{n}) = O(n \log n)$$$I dont think computer are smart enough to solve that kind of loop.
but n is constant (1e6)
So?
It is more complex then you think just a $$$O(1)$$$ and compiler can predict all 2-loops.
Some problem are even already hard to make $$$O(n \log n) \rightarrow O(n \log \log n)$$$ even if the inside function run in $$$O(1)$$$
he is trying to make joke about O(any constant) = O(1), and 10^6 log 10^6 is constant here
Ok I get the joke. And well it is also true as there is the fact that the loop $$$10^6$$$ parts are not dependent on a variable taken from the input.