Lightoj1236-pairs Forming LCM (lcm+ unique decomposition theorem)

Topic Links:

https://vjudge.net/problem/LightOJ-1236 topic:

Given a number n N, to satisfy I≤J<N∧LCM (i,j) =n i \le J (i,j) (I, j) for a total number of. Problem Solving Process:

Thought for a while ... No, look at the blog, just as a conclusion OK. Topic Analysis:

For each pair (I,J) (I, j), the unique decomposition theorem can be written as follows:
N=pe11⋅pe22...pekk n = p_1^{e_1} \cdot p_2^{e_2} \dots P_k^{e_k}
I=pa11⋅pa22...pakk i = p_1^{a_1} \cdot p_2^{a_2} \dots P_k^{a_k}
J=PB11⋅PB22...PBKK j = p_1^{b_1} \cdot p_2^{b_2} \dots P_k^{b_k}

The necessary and sufficient condition to make the LCM (i,j) =n LCM (i, j) = n is to satisfy Max (AI,BI) =ci