Search found 1 match

by iz
Wed Sep 27, 2006 9:34 am
Forum: ACM ICPC Archive Board
Topic: p2195 Counting Zeroes (dhaka regionals)
Replies: 25
Views: 11308

explanation

If you do the factorization properly it will not TL. So first find all primes in the range [2, sqrt(n) ] using http://en.wikipedia.org/wiki/Sieve_of_Eratosthene. Now you have to find the number of the divisors of n, then count the divisors of the form x^2, x^3,..., x^k(where x divides n), and add th...

Go to advanced search