Hello Codeforces Community

Meet this guy prakharguptaujjain4, He is a cheater and has been flaunting his candidate master title on LinkedIn and also this, user participated in IICPC Codefest qualification round, where he got rank 24 and then i think he was not selected for the finals (obviously, because he cannot use AI there). So, I hope everyone can report this guy and remove his handle from the community.

For proofs , you can check his profile and submission during the contest. I am also attaching one image of DIV3 round where he got 115 rank. notice the change of languages during the contest.

Also, he didn't solve problem E in the Round 1008, which was interactive one (i think AI still cannot solve interactive problems) but solve problem F.

Problem statement,

you are given an array of positive integers of size n, and an integer k.
for each pair of (i, j) in the array, where 1 <= i <=n and 1 <= j <=n, m is the minimum value such that lcm(a[i], a[j]) * m is a multiple of k.
you need to find the sum of values of m. i.e find the m for each pair and then take the sum of these value.

constraints:
$$${1} \leq{n} \leq{10}^{5}$$$
$$${1} \leq{k} \leq{10}^{6}$$$
$$${1} \leq{a[i]} \leq{10}^{9}$$$

I encountered this problem in an OA.

if anybody can provide solution to this, I would be very happy.
Thanks In Advance!

I want to see how many reply will require on a single comment such that the last reply contains single character on each line.

According to wikipedia, Bitonic sort complexity is log^2n. Is it true ?