Be the first person to solve this problem and help me to solve it :D

problem : live archive -> 6082 — Groovy numbers problem link : https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4093

I tried to solve it using two different ways but still getting WA !!

https://ideone.com/8i98mo This solution uses the normal way to get all divisors of a number it just iterate through sqrt of the number and check each divisor.

https://ideone.com/5wNLzi#stdin This solution uses factorization to get all divisors of a number