Hi :), I was solving 1228C - Primes and Multiplication, I found a solution for that during the virtual contest, but it failed on third sample testcase

I think that my solution is correct, anyway, if you found a bug inside my code or you think that my solution is totally wrong, please tell me inside the comments section :)

#### here is my solution:

lets set the initial value of $$$ans$$$ to 1

for each $$$p$$$ in prime divisors of $$$x$$$, let's iterate over all powers of $$$p$$$ witch are less than $$$n$$$ ($$$p^1$$$, $$$p^2$$$, $$$p^3$$$, ...), for each number like $$$k$$$ witch $$$p^k <= n$$$, let's count all numbers $$$y$$$ less than or equal $$$n$$$ where $$$g(y, p) = p^k$$$ and call this number $$$c$$$, and multiply the $$$ans$$$ with $$$(p^k)^c$$$

this is how we can calculate $$$c$$$: $$$\lfloor n / p^k \rfloor - \lfloor n / p^{k + 1} \rfloor $$$

#### this is my code:

**Code**

**My answer for sample test3: 532291087**

**The real answer for sample test3: 593574252**

and sorry for my bad English :)