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
#include <cstdio>
#include <cstring>
const int N = 1e7 + 5;
typedef long long ll;
int prime[N/10];
bool vis[N];
ll cnt;
void set_prime(){ //素数筛法
memset(vis,false,sizeof(vis));
cnt = 0;
for (int i = 2; i < N; ++i){
if (!vis[i]) prime[cnt++] = i;
for(int j = 0; j < cnt && prime[j] * i < N; ++j)
{
vis[prime[j] * i] = 1;
if(i % prime[j] == 0) break;
}
}
}
int main(){
set_prime();
int t;
int kase = 1;
scanf("%d",&t);
while (t--){
ll n;
scanf("%lld",&n);
ll ans = 1;
for (int i = 0; i < cnt; ++i){
if(ll(prime[i])*prime[i] > n) break;
int c = 0;
while (n%prime[i] == 0){
n/=prime[i]; c++;
}
if (c) ans*=2*c+1;
}
if (n > 1) ans*=3;
printf("Case %d: %lld\n",kase++,ans/2+1);
}
return 0;
}