Factorial factor

CodeChefOpen on judge ↗

Problem description. Given an integer n and x. Find the sum of unique prime factors of n!x. Input - The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. - Each input contains only a single line consisting of two integers, n and x. Output - Print a single integer, sum of all the prime factors. Constraints - 1 ≤ T ≤ 100

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