LightOJ1236 - 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

题意

找出对于整数对（i，j),他们的lcm为n，这样的整数对有多少。满足i <= j

题解

看到了LCM(i,j) 要想到唯一分解定理和GCD

而这题，我们假设( a , b ) = n ，那么： 

图片来自https://blog.csdn.net/qq_15714857/article/details/48641121

代码

n=pk11pk22⋯pkss,a=pd11pd22⋯pdss, b=pe11pe22⋯pess,可以确定max(ei,di)=ki,那么ki的组成就是ei与di中一个等于ki，另一个任取[0,ki]中的一个数，那么就有2(ki+1)种方案，实际上由于ei=di=ki方案会出现重叠，所以第i位方案数为2(ki+1)−1=2ki+1，有序对(a,b)方案数就是(2k1+1)(2k2+1)⋯(2ks+1)，无序对(a,b)方案数就是:[(2k1+1)(2k2+1)⋯(2ks+1)+1]/2(n,n)已经只有一个，不会重复，所以+1。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7+10;
bool isprime[maxn];
vector<int> primes;
void creatprime()
{
    memset(isprime,true,sizeof(isprime));
    primes.clear();
    isprime[0] = isprime[1] = 0;
    for(int i=2;i<maxn;i++) {
        if(isprime[i]) primes.push_back(i);
        for(int j=0;j<primes.size() && i*primes[j]<maxn;j++) {
            isprime[i*primes[j]] = 0;
            if(i % primes[j] == 0) break;
        }
    }
}
ll solve(ll n)
{
    ll ans = 1;
    for(int i=0;i<primes.size() && primes[i]*primes[i] <= n;i++) {
        if( n % primes[i] == 0) {
            int cnt = 0;
            while(n % primes[i] == 0) n/=primes[i],cnt++;
            ans *= (2*cnt+1);
        }
    }
    if( n > 1 ) ans *= 3;
    ans>>=1;ans++;
    return ans;
}
int main()
{
    creatprime();
    int caset,cas=0;scanf("%d",&caset);
    ll n;
    while(caset--) {
        scanf("%lld",&n);
        printf("Case %d: %lld\n",++cas,solve(n));
    }
    return 0;
}