5341：Gcd and Lcm

题目描述

$\sum_{i=1}^n\sum_{j=1}^n\sum_{k=1}^n\sum_{l=1}^n [(i,j),(k,l)]$

输入解释

First line contains a single integer $T \leq 100$ which denotes the number of test cases.

For each test case, there is an positive integer $n \leq 10^{7}$.

输出解释

For each case, output an integer in a single line means the answer mod $2^{32}$.

输入样例

1
1

输出样例

提示

[a,b] means lowest common multiple of a and b,(a,b) means greatest common divisor of a and b.

来自杭电HDUOJ的附加信息

Recommend

hujie

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 BestCoder Round #49 ($)

源链接： HDU-5341

最后修改于 2020-10-25T23:21:51+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
6000/3000MS(Java/Others)	524288/524288K(Java/Others)