Minimum spanning tree

Problem Description

Given n-1 points, numbered from 2 to n, the edge weight between the two points a and b is lcm(a, b). Please find the minimum spanning tree formed by them.

A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible.

lcm(a, b) is the smallest positive integer that is divisible by both a and b.

Input

The first line contains a single integer t (t<=100) representing the number of test cases in the input. Then t test cases follow.

The only line of each test case contains one integers n (2<=n<=10000000) as mentioned above.

Output

For each test case, print one integer in one line, which is the minimum spanning tree edge weight sum.

Sample Input

2 2 6

Sample Output

0 26

代码如下

#include<iostream>
#define rep(i,x,y) for(auto i=(x);i<=(y);++i)
#define dep(i,x,y) for(auto i=(x);i>=(y);--i)
using namespace std;
typedef long long ll;
default_random_engine e;
int ui(int l,int r){
    uniform_int_distribution<int>u(l,r);
    return u(e);
}
ll ul(ll l,ll r){
    uniform_int_distribution<ll>u(l,r);
    return u(e);
}
double ud(double l,double r){
    uniform_real_distribution<double>u(l,r);
    return u(e);
}
const int N=2e6+10;
bool v[N];
int main(){
    e.seed(time(0));srand(time(0));
    freopen("in.txt","w",stdout);
    int t=100;
    printf("%d\n",t);
    rep(i,1,t){
        int n=ui(2,10000000);
        printf("%d\n",n);
    }
}