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?
Swap the first and last columns
9145 Solvers
590 Solvers
118 Solvers
331 Solvers
393 Solvers