NC222977. Calculation
描述
Consider n's prime factorization is 
,and %7D%3D(-1)%5E%7Ba_1%2Ba2%2B%E2%80%A6%E2%80%A6a_k%7D&preview=true)
.
For example ,%7D%3D1%EF%BC%8C%5Clambda%7B(2)%3D-1%7D.Specially%2C%5Clambda%7B(1)%7D%3D1)
.
Calculate the value of *%5Clambda(j)*%5Bi%7Cj%20%5C%20and%5C%20%20j%7Ck%5D%7D&preview=true)
输入描述
One integers n.
输出描述
One integer,the answer mod 998244353.
示例1
输入:
10
输出:
13
NC222977. Calculation
描述
输入描述
One integers n
输出描述
One integer,the answer mod 998244353.
示例1
输入:
10
输出:
13
C++ 解法, 执行用时: 22ms, 内存消耗: 408K, 提交时间: 2022-06-04 02:28:46
#include<iostream>
long long i=1,n,ans;
int main()
{
std::cin>>n;
for(;i*i<=n;i++)
ans=(ans+n/i/i)%998244353;
std::cout<<ans;
}