Problem link: COMDIV - Number of common divisors
For this we need to know
CommonDivisor(a,b) = NumberOf Divisor(gcd(a,b)) proof
Find the number of divisors: Time Complexity O(sqrt(n))
tutorial for finding the number of divisors : progkriya
Solution:
For this we need to know
CommonDivisor(a,b) = NumberOf Divisor(gcd(a,b)) proof
Find the number of divisors: Time Complexity O(sqrt(n))
tutorial for finding the number of divisors : progkriya
Solution:
No comments:
Post a Comment