Efficent solution(1.0 sec.) for counting divisiors

Правка en3, от namespace12, 2020-09-25 12:09:05

I've tried to solve this using sieve and prime factorization but I got TLE for some cases. Here is the CSES problem:) (https://cses.fi/problemset/task/1713/)

Here is my solution)

I need a more efficient approach.

Теги #divisors, #sieve, #countingdivisors, #prime

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский namespace12 2020-09-25 12:09:05 7 Tiny change: 'deone.com/)\n \nI ne' -> 'deone.com/EiLUs2))\n \nI ne'
en2 Английский namespace12 2020-09-25 11:51:29 3
en1 Английский namespace12 2020-09-25 11:50:34 297 Initial revision (published)