hdu5922Minimum’s Revenge+水题

Problem Description
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?

Input
The first line contains only one integer T (T≤100), which indicates the number of test cases.

For each test case, the first line contains only one integer n (2≤n≤109), indicating the number of vertices.

Output
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.

Sample Input

2
2
3

Sample Output

Case #1: 2
Case #2: 5
Hint

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.

Source
2016CCPC东北地区大学生程序设计竞赛 - 重现赛

n个节点。1~n，每条边的权值等于两边两个点的编号的LCM….求最小生成树
直接1与每个节点都相连。这样每条边的LCM==b
直接就是2+3+4+。。。+n

#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
    LL n;
    int t;
    cin>>t;
    for(int cas=1;cas<=t;cas++){
        cin>>n;
        cout<<"Case #"<<cas<<": "<<(2+n)*(n-1)/2<<endl;
    }
    return 0;
}