vsanjay_nitdgp's blog

prime fctors
By vsanjay_nitdgp, history, 9 years ago, In English

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

http://ideone.com/G6t0fX

thanks in advance

  • Vote: I like it
  • -5
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This is can be solved by applying sieve and count the different prime factors for your numbers.

→ Reply