A Factorial Problem

[aiman.mumtaz]

Hey. I really need to understand what is happening here. Can you please ellaborate the code for me?

[aiman.mumtaz]

Like what is the purpose of mp?

[abhijeet.srivastava6499 (Abhijeet Srivastava)]

@aiman.mumtaz,
Have you understood the logic of solving the problem itself?, we will move to explanation of implementation, only after we establish that.

[aiman.mumtaz]

No. I didn’t understand it completely. Especially the non prime part.

[abhijeet.srivastava6499 (Abhijeet Srivastava)]

@aiman.mumtaz,
Please read this carefully and repeatedly(if necessary) and try to understand, it’s basically just a mathematical problem.

Please explain the editorial code

@02.adarsh.99, Logic: x = min(ci / ki), ci = max power of pi in n!, ki = max power of pi in K, pi = its prime factor; So how to find ki…?? Simple just keep dividing K by pi till k%pi==0. Now how to find ci…?? Basic PnC, Highest power of pi in n! = floor(n / pi) + floor (n / (pi * pi)) + floor(n / (pi * pi * pi)) … So the code is just direct implementation of this.

[abhijeet.srivastava6499 (Abhijeet Srivastava)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.