APTZ_FRUIT MIX PUNCH_CHALLENGE

CodeChefOpen on judge ↗

Euler totient function is used in RSA algorithm. In Cryptography, “Keys” need to be kept as a secret in any means necessary. And RSA algorithm will help in key generation and transmission. If p, and q are prime numbers and p ≠ q Then Euler totient function, ET (p, q) = (p-1) * (q-1) Our Chef wants to check if the given value n is Euler function value or not. If it is not then output “-1”. If i

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