the question is very simple we just need to calculate total number of numbers which have exactly 4 divisors for ex 6, 8, 10 these are all of the forms p^3 or p*q but here n<=10^11
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
the question is very simple we just need to calculate total number of numbers which have exactly 4 divisors for ex 6, 8, 10 these are all of the forms p^3 or p*q but here n<=10^11
Name |
---|
Auto comment: topic has been updated by shrohit_007 (previous revision, new revision, compare).
Here $$$\pi(n)$$$ denotes prime counting function, i.e number of primes not greater than $$$n$$$.
Numbers form $$$p^3$$$ can be easily counted, it's just $$$\pi \left(\lfloor \sqrt[3]{n} \rfloor\right)$$$.
To calculate numbers form $$$pq$$$ recall, that
.
Primes and $$$\pi$$$ up to $$$\sqrt{n}$$$ can be calculated straightforward using Eratosphenes sieve.
Also you can calculate values of $$$\pi\left( \lfloor \frac{n}{k} \rfloor \right)$$$ for all $$$k \geqslant 1$$$ using $$$O(n^{2/3})$$$ time as described here https://mirror.codeforces.com/blog/entry/91632
IMHO this question is not very simple as it requires some knowledge.