Special Primes

CodeChefOpen on judge ↗

Let's introduce some definitions that will be needed later. The question is twisting and interesting .Read the statement carefully. For example, prime(140)={2,5,7}, prime(169)={13}. A Function prime(c) contains the set of prime factors of c. Consider g(c,p) be a function with the maximum possible integer p^k where k is an integer such that c is divisible by p^k. For example: g(45,3)

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