https://acs.jxnu.edu.cn/problem/ICPCJX2020A
A Simple Math Problem
1000ms 131072K
描述:
Huanhuan challenges you to a simple math problem.
(欢欢对你提出了一个简单数学问题的挑战)
Define F(x)as the sum of the decimal digits of x.
(定义F(x)作为十进制数字x的和)
For example: F(123)=1+2+3=6F(123)=1+2+3=6, F(700)=7+0+0=7F(700)=7+0+0=7.
Huanhuan wants you to calculate the sum of F(j)for every i, j that satisfy 1≤j≤i≤n and i,j are coprime.
(欢欢想要你去计算F(j)对于每个i的和,j满足1≤j≤i≤n,并且I,j都是互质的)
More formally, calculate ∑i=1n∑j=1i[gcd(j,i)=1]F(j)∑i=1n∑j=1i[gcd(j,i)=1]F(j).
输入:
There are only one test case with a single integer n(1≤n≤105)n(1≤n≤105).(只有一个用单个整数数字测试情况)
输出:
Print one integer, the answer of ∑i=1n∑j=1i[gcd(j,i)=1]F(j)∑i=1n∑j=1i[gcd(j,i)=1]F(j).
(输出一个整数,这个答案为∑i=1n∑j=1i[gcd(j,i)=1]F(j)∑i=1n∑j=1i[gcd(j,i)=1]F(j).)