How do I find this for large N? (N ≤ 1011).
Numbers can be either of the form P * Q or P3, where P and Q are primes.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
How do I find this for large N? (N ≤ 1011).
Numbers can be either of the form P * Q or P3, where P and Q are primes.
Название |
---|
Problem F.
Thanks! :)
https://en.wikipedia.org/wiki/Prime-counting_function ,
There is The Meissel–Lehmer algorithm, counting number of primes.
Hope it will help you)