Digit Last

CodeChefOpen on judge ↗

Given a number n. Find the last two digits of 5 ^ n ( 5 to the power of n ). Remember that overflow can occur. ###Input: - N — the power in which you need to raise number 5. ###Output: Last two digits of 5^n. ###Constraints - $2 \leq N \leq 2.1018$ ###Sample Input: 2 ###Sample Output: 25

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