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.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.
Name |
---|
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)