英文题面:来源地址:A Simple Math Problem | JXNUOJ
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.
For example: F(123)=1+2+3=6, F(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.
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).
输出:
Print one integer, the answer of ∑i=1n∑j=1i[gcd(j,i)=1]F(j).
翻译:
一个简单的数学问题
描述:
欢欢给了你一个简单的数学问题。
定义F(x)是整数x的各个位数的和,例如F(123)=1+2+3=6,F(700)=7+0+0=7.
欢欢希望你能够计算每一个满足1≤j≤i≤n和i与j互质的F(j)的和。
简单点说就是计算∑i=1n∑j=1i[gcd(j,i)=1]F(j).
输入:
只需要输入一个整数n(1<=n<=105).
输出:
一个整数,即∑i=1n∑j=1i[gcd(j,i)=1]F(j)的结果。