Another Factorial Problem

CodeChefOpen on judge ↗

Every programming contest has a problem on factorials. Continuing with this tradition, we decided to include one too. Given two integers, n and p, find x (mod p) where x is the number obtained after eliminating all powers of p from n!. Here n! denotes factorial of n. Assume that p is prime. Input The first line of the input contains an integer T denoting the number of test cases. This is follo

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI