***************************************Factors*************************************

So recently when I was studying some basics of combinatorics i got an idea of a problem, So in this blog I will be sharing the problem and the solution of the problem. And the solution of the problem.

So the problem statement is :

You are given a no N and m queries. there 3 type of queries :

Type 1 : You have to print the total no of factors of N. Type 2 : You have to print the total sum of factors of N. Type 3 : You have to print the total sum of the reciprocals of the factors of N.

Solution :

Time Complexity O(log(N)). Space Complexity O(N).