Why am I getting WA in this code?
I am dividing 'x' by all the prime numbers. To find the prime numbers, I am using the sieve. I know, it can be done without using the sieve, but when I am using the sieve, I am getting WA. Can someone please help ?
It would be really kind if someone could point out the bug.
xto check for divisors of original
xin this part of code:
AC solution: 32667979