Playing with Modulus

CodeChefOpen on judge ↗

Find the value of (AB/C)%M. Input The only line of input consists of four integers A,B,C and M. The input always has C and M such that gcd(C,M)=1. Output Print the answer as asked in the problem statement. Constraints - 1 ≤ A,B,C,M ≤ 109 - gcd(C,M)=1 Input: 2 3 4 5 Output: 2

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