lOJ 1236 - Pairs Forming LCM

1236 - Pairs Forming LCM

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Find the result of the following code:

long long pairsFormLCM( int n ) {
    long long res = 0;
    for( int i = 1; i <= n; i++ )
        for( int j = i; j <= n; j++ )
           if( lcm(i, j) == n ) res++; // lcm means least common multiple
    return res;
}

A straight forward implementation of the code may time out. If you analyze the code, you will find that the code actually counts the number of pairs (i, j) for which lcm(i, j) = n and (i ≤ j).

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 10¹⁴).

Output

For each case, print the case number and the value returned by the function 'pairsFormLCM(n)'.

Sample Input	Output for Sample Input
15 2 3 4 6 8 10 12 15 18 20 21 24 25 27 29	Case 1: 2 Case 2: 2 Case 3: 3 Case 4: 5 Case 5: 4 Case 6: 5 Case 7: 8 Case 8: 5 Case 9: 8 Case 10: 8 Case 11: 5 Case 12: 11 Case 13: 3 Case 14: 4 Case 15: 2

/*
将n分解质因数，得到结果n=p1^x1+p2^x2+p^x3

两个数a,b
a取xi个pi,b取(xi-1,xi-2……0) 共xi个
反过来b取xi个pi,a可以取与上述的b的个数
再加上a,b都取xi个的情况一共xi*2+1种情况
一次即为因子pi的方案数，且重复了一次
最后相乘就是所有因子的方案数，再加上只算了一次的n，加1，即为总方案数的二倍
Time:2015-03-17 20:26
*/
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MAX=10000000+10;
bool vis[MAX+10]={1,1,0,0};
vector<int>pri;
void Init(){
    for(int i=2;i<=MAX;i++){
        if(vis[i])continue;
        for(int j=i+i;j<=MAX;j+=i){
            vis[j]=true;
        }
        if(!vis[i])pri.push_back(i);
    }
}
LL solve(LL n){
    LL x=n;
    LL ret=1;
    for(int i=0; pri[i]*pri[i]<=x && i<pri.size() ;i++){
        if(x%pri[i]==0){
            LL cnt=0;
            while(x%pri[i]==0){
                x/=pri[i];
                cnt++;
            }
            ret*=((cnt<<1)+1);
        }
    }
    if(x>1){
        ret+=(ret<<1);
    }
    return (ret+1)>>1;
}
int main(){
    int T;
    LL n;
    int nCase=1;
    Init();
    scanf("%d",&T);
    while(T--){
        scanf("%lld",&n);
        LL ans=solve(n);
        printf("Case %d: %lld\n",nCase++,ans);
    }
return 0;
}