i solve it(The Most Complex Number) with .046s . how can solve it with .015s ? here my solution.
please , anyone give me some hints .
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | adamant | 156 |
5 | cry | 155 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
i solve it(The Most Complex Number) with .046s . how can solve it with .015s ? here my solution.
please , anyone give me some hints .
Name |
---|
You may hardcode all highly composite numbers and then answer every query in log time using binary search)
I don't know about highly composite numbers . can you give me some link about this ?
Some link — it is essentially set of all possible answers :)
thanks :)
You can find the 1st 70 prime numbers and then for each 'n', loop through these numbers in the following way-
Start from i=0, ans=1. ans=ans*prime[i] as long as ans<=n. i++.
if ans*prime[i]>n, reset i=0 and repeat step 1 until its no longer possible. Maintain a hash of these primes you are using for frequency.
edit: we can pre calculate product of these primes in an array, and for each test case, we do a few binary searches. Why so many downvotes?