|LC 1447. Simplified Fractions||GCD||4 points|
|LC 1390. Four Divisors||#Divisors||3 points|
|LC 1360. Number of Days Between Two Dates||Date||5 points|
The this post, we introduced how to get all prime numbers from 1 to n in o(nloglogn) time. Base on which, we can do prime factorization in O(logn) time.
Prime Numbers in [1, n] The naive method takes O(n^1.5)) time. We could use the famous Sieve of Eratosthenes algorithm.
Summary In this post, I will introduce some common techniques related to divisors and factors. Details Number of Divisors GCD
Summary In this post, I will introduce some problems related to date. Details Is Leap Year Days of the Year Days from 1900 Days Between Dates