My solution involves calculating the number of divisors of all perfect squares <= 10^10 and storing them in a map keyed on the number of divisors. I think this one of the algorithms that should be getting AC (others have done it in C++). I am however getting TLE.
Considering that there is a passing Python solution to this problem, it should be possible to get this to work in Haskell too!
created
Aug '12last reply
Oct '14- 1
reply
- 990
views
- 2
users
