Discrete Logarithm

CodeChefOpen on judge ↗

Decipher Codefest'16 Professor RNC was teaching cryptography in the class. He gave an interesting idea to students about hiding some information using modular exponentiation. Sookhi being one of the enthusiastic students of the class tried to challenge the Professor by saying that he can break the Discrete Logarithm problem easily. RNC accepted his challenge on one condition that if Sookhi fails

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