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 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | Proof_by_QED | 131 |
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)