Problem I. Problem I. Count
时间限制 2000 ms
内存限制 512 MB
Multiple query, for each n, you need to get
n i-1
∑ ∑ [gcd(i + j, i - j) = 1]
i=1 j=1
输入数据
输出数据
Your output should include T lines, for each line, output the answer for the corre- sponding n.
样例输入
样例输出
复制
194041
38951
11065
89963
$ Mathjax font initiator $