Prime Swap

CodeChefOpen on judge ↗

Chef and Zoro were playing with a number. Chef asked Zoro a question to solve with his curiosity. The question is how many distinct numbers he can obtain if in the prime factorization of the original number he is allowed to perform infinite number of swaps between exponents of the adjacent prime factors. Formally if the prime factors are P1,P2,P3 ,.., Pn and the exponents are e1,e2,e3 ,..., en you

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