Digging deeper into modulus

CodeChefOpen on judge ↗

You are given two numbers $n$ and $m$. Print $n$ modulo $m$. ###Input: - First and only line of input contains two integers n and m ###Output: Print a single line containing $n$ $mod$ $m$ ###Constraints - $1 \leq |n| \leq 10^5$ where |n| represents number of digits in n - $2 \leq m \leq 10^9$ ###Subtasks -100 points original constraints ###Sample Input: 142 11 ###Sample Output: 10 ###E

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