题意:
求1-n有多少对数的LCM正好为 n
先求 N 的标准分解试
p1 ^ a1 * p2 ^ a2 .......... pk ^ ak;
有LCM 的可知 (a, b) 中必必有一个 含有 pi ^ ai;
另一个则是 pi ^ 0 . . ...... pi ^ ai;
所以一共有 NUM = II (ai +1 ) * 2 - 1
又因为 对数是有序的
所以为 NUM / 2 + 1;(n,n)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#define lson l , m, rt << 1
#define rson m+1, r, rt << 1|1
#define INF 0x7fffffff
const long long maxn = 1e7 + 131;
const int MOD = 10000007;
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
LL Primes[maxn / 10], Count;
bool Jug[maxn];
void INT() {
Count = 0;
memset(Jug,0,sizeof(Jug));
for(LL i = 2; i <= maxn; ++i)
{
if(Jug[i] == 0)
{
Primes[Count++] = i;
for(LL j = i*i; j <= maxn; j += i) Jug[j] = 1;
}
}
}
int main() {
INT();
//for(int i = 0; i < 20; i++) cout << Primes[i] << endl;
int T;
cin >> T;
for(int kase = 1; kase <= T; ++kase)
{
ULL a;
ULL ans = 1;
cin >> a;
for(int i = 0; i < Count && Primes[i] * Primes[i] <= a; ++i)
{
if(a % Primes[i] ==0) {
LL tot = 0;
while(a % Primes[i] == 0) tot++, a /= Primes[i];
ans *= (tot*2+1);
}
}
if(a > 1) ans *= 3;
printf("Case %d: %llu\n",kase,(ans / 2 + 1));
}
return 0;
}