Minimum’s Revenge
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 505 Accepted Submission(s): 346
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?
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.
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: 5HintIn 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.题目大意:给你1~n,任意两点的权值为他们的乘积,问连接说有的点最小需要的权值和为多少
解题思路:这道题有点最小生成树的感觉,既要算两点间的权值,还要进行最小生成树的过程,好麻烦。但是仔细观察,任意一点都与1相连权值是最小的,所以是一个比较简单的数学问题。下面是代码:#include <cstdio> #include <iostream> #include <algorithm> using namespace std; typedef long long LL; int main() { int T,case=0; LL n; cin>>T; while(T--) { LL sum=0; cin>>n; sum=(1+n)*n/2-1; //用1~n的等差数列和减去1,数学方法 printf("Case #%d: %lld\n",++case,sum); } return 0; }