the problem ...↵
↵
https://mirror.codeforces.com/group/H10hR2t6Sj/contest/338701/problem/J↵
↵
Let M be a positive integer.↵
↵
Let f(M) be the number of positive divisors of an integer M.↵
↵
For example f(12)=6 and they are 1,2,3,4,6,12.↵
↵
Let g(M) be The summation of number of divisors of the divisors of an integer M.↵
↵
Mathematically we can say g(M)=∑i|Mf(i), where | means divides.↵
↵
For example, g(12)=f(1)+f(2)+f(3)+f(4)+f(6)+f(12)=1+2+2+3+4+6=18.↵
↵
You are given an integer n, Calculate g(n!).↵
↵
*** While ..( 1 ≤ n ≤ 1e6 ).*******↵
↵
How i can solve this Problem ?
↵
https://mirror.codeforces.com/group/H10hR2t6Sj/contest/338701/problem/J↵
↵
Let M be a positive integer.↵
↵
Let f(M) be the number of positive divisors of an integer M.↵
↵
For example f(12)=6 and they are 1,2,3,4,6,12.↵
↵
Let g(M) be The summation of number of divisors of the divisors of an integer M.↵
↵
Mathematically we can say g(M)=∑i|Mf(i), where | means divides.↵
↵
For example, g(12)=f(1)+f(2)+f(3)+f(4)+f(6)+f(12)=1+2+2+3+4+6=18.↵
↵
You are given an integer n, Calculate g(n!).↵
↵
*** While ..( 1 ≤ n ≤ 1e6 ).*******↵
↵
How i can solve this Problem ?
