HDU 5922 Minimum’s Revenge 【最小生成树】

Minimum’s Revenge

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

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.
   
   
   
   

    
    
一个图，n个点，1~n，任意两个点之间的边长为lcm(u,v)，求最小生成树。
    
    
直接1连每个点 :  2+3+...+n=((2+n)*(n-1))/2。
    
    

   
   
   
   

    
    
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long LL;
const int INF=0x7ffffff;

LL sum,n;

int main()
{
  int T;
  int Case=1;
  scanf("%d",&T);
  while(T--){
    scanf("%lld",&n);
    sum=((n+2)*(n-1))/2;
    printf("Case #%d: %lld\n",Case++,sum);
  }
  return 0;
}