i solve it(The Most Complex Number) with .046s . how can solve it with .015s ? here my solution.
please , anyone give me some hints .
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
i solve it(The Most Complex Number) with .046s . how can solve it with .015s ? here my solution.
please , anyone give me some hints .
Название |
---|
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?