Problem 2664. Divisors for big integer
Inspired by Problem 1025 and Project Euler 12.
Given n, return the number y of integers that divide N.
For example, with n = 10, the divisors are [1 2 5 10], so y = 4.
It's easy with normal integer but how to proceed with big number?
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers151
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1568 Solvers
-
341 Solvers
-
Implement a bubble sort technique and output the number of swaps required
321 Solvers
-
918 Solvers
-
Double all elements in the array
1723 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!