Cody

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?

Solve

Solution Stats

47.89% Correct | 52.11% Incorrect
Last Solution submitted on Dec 31, 2019

Problem Comments

Problem Recent Solvers27

Suggested Problems

More from this Author43

Problem Tags

divisors projecteuler