| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 149 |
| 6 | SecondThread | 148 |
| 7 | Petr | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
this is my solution http://ideone.com/5i1hV2 for the problem
https://www.codechef.com/LTIME16/problems/CHEFB
in this problem i am getting TLE whn n<=100000 and array size<=1000000
but when i removed memset and wrote that step normally by bruteforce ....i got AC........
what happened with that memset();
why?????????????????
this is my modified solution
thanks in advance
This is can be solved by applying sieve and count the different prime factors for your numbers.
any link to refer
Try this — http://mirror.codeforces.com/blog/entry/8989 :)
UPD: And this is for fast factorization — http://mirror.codeforces.com/blog/entry/7262 :)