Count Prime Factorial

CodeChefOpen on judge ↗

You are given a number "n" and you have to find count of a number "x" in Prime Factorization of factorial n. If there is no such prime factor "x" print "-1". ### Input - First line contains an integer t- The number of test cases. - Next t lines contains two integers n,x. ### Output Output of each test case contains a single integer- count of x. ### Constraints - 1 <= t <= 10^5. - 1 <= n <= 10^1

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