Pairs Forming LCM [数学][最小公倍数为n的数对]

Find the result of the following code:

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

解题报告

素因子分解一定要打素数表，不然超时 分析过程： a=pG11pG22…pGkkb=pH11pH22…pHkkn=pR11pR22…pRkk $$a=p_1^{G_1}p_2^{G_2}…p_k^{G_k}//b=p_1^{H_1}p_2^{H_2}…p_k^{H_k}//n=p_1^{R_1}p_2^{R_2}…p_k^{R_k}$$ 若 LCM(a,b)=n ,即 ⎧⎩⎨⎪⎪⎪⎪⎪⎪R1=Max{G1,H1}R2=Max{G2,H2}…Rk=Max{Gk,Hk} $$/begin{cases}R_1=Max/{G_1,H_1/} //R_2=Max/{G_2,H_2/} //…//R_k=Max/{G_k,H_k/}/end{cases}$$ 则a,b的组合个数 cnt=(C12⋅(R1+1)−1)⋅(C12⋅(R2+1)−1)⋅…⋅(C12⋅(Rk+1)−1) $$cnt=(C_{2}^1 /cdot (R_1+1) -1)/cdot (C_{2}^1 /cdot (R_2+1) -1)/cdot …/cdot (C_{2}^1 /cdot (R_k+1) -1)$$ 由于a < b ， 但a=b时只有一个，那么答案就是 ans=cnt/2+1 $$ans=cnt/2 +1$$