当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5922：Minimum’s Revenge

题目描述
There is a graph of n vertices which are indexed from 1 to n. For any pair of different vertices, the weight of the edge between them is the least common multiple of their indexes.

Mr. Frog is wondering about the total weight of the minimum spanning tree. Can you help him?
输入解释
The first line contains only one integer T ($T \leq 100$), which indicates the number of test cases.

For each test case, the first line contains only one integer n ($2 \leq n \leq 10^9$), indicating the number of vertices.
输出解释
For each test case, output one line "Case #x：y",where x is the case number (starting from 1) and y is the total weight of the minimum spanning tree.
输入样例 
2
2
3
输出样例 
Case #1: 2
Case #2: 5
提示
In the second sample, the graph contains 3 edges which are (1, 2, 2), (1, 3, 3) and (2, 3, 6). Thus the answer is 5.
来自杭电HDUOJ的附加信息
Recommend wange2014
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2016CCPC东北地区大学生程序设计竞赛 - 重现赛
源链接： HDU-5922
最后修改于 2020-10-25T23:26:45+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)