Pairs Forming LCM LightOJ - 1236————（算术基本定理+容斥）

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 ≤ 1014).$

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

Sample Input
15
2
3
4
6
8
10
12
15
18
20
21
24
25
27
29
Sample Output
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，找出$(i,j)$使得$lcm(i,j)=n$，其中$1\le i\le j\le n$
问有多少对这样的$(i,j)$

思路：对于n我们可以写成

$$n=p_1^{a_1}p_2^{a_2}\cdots p_n^{a_n}$$
同理，i和j也可以写成这个形式 $$i=p_1^{b_1}p_2^{b_2}\cdots p_n^{b_n}$$ $$j=p_1^{c_1}p_2^{c_2}\dots p_n^{c_n}$$
因为 $\quad lcm(i,j)=n$
所以 $$a_1=max(b_1,c_1) \\ a_2=max(b_2,c_2)\\ \cdots \\ a_n=max(b_n,c_n)$$
其中 $$b_i\; or\; c_i =a_i$$

当$\; b_i\; =\;a_i\;$的时候，$0\le c_i \le a_i\;$有$a_i+1$种情况
当$\; c_i\; =\;a_i\;$的时候，$0\le b_i \le a_i\;$有$a_i+1$种情况
一共有$2(a_i+1)$种情况
但是$b_i=c_i=a_i$的情况出现了两次，所以我们要去重，去重后结果是$2a_i+1$种情况
又因为$i\le j$
所以最终的结果

$$2*ans=\prod_{i=1}^{n}(2a_i+1)$$
故 $$ans=\frac{ \prod_{i=1}^{n}(2a_i+1)}{2}$$

第一次做的时候没有打素数表，导致TLE一次…

---

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
using namespace std;
typedef long long ll;
const int MAXN=1e7+9;
bool vis[MAXN];
int prime[1000000];
void getprime()
{
    prime[0]=0;
    for(int i=2;i<MAXN;i++)
    {
        if(!vis[i]) prime[++prime[0]]=i;
        for(int j=2;j*i<MAXN;j++)
            vis[i*j]=1;
    }
}

int main()
{
    int t;
    int kase=0;
    getprime();
    scanf("%d",&t);
    while(t--)
    {
        ll n;
        ll ans=1;
        scanf("%lld",&n);
        for(ll i=1;(long long)prime[i]*prime[i]<=n&&i<prime[0];i++)
        {
            int cnt=0;
            if(n%prime[i]==0)
            {
                while(n%prime[i]==0)
                {
                    cnt++;
                    n/=prime[i];
                }
                ans*=2*cnt+1;
            }
        }
        if(n!=1)    ans*=2*1+1;
        printf("Case %d: %lld\n",++kase,(ans+1)/2);
    }
    return   0;
}