Find Remainder

CodeChefRating 421Open on judge ↗

Write a program to find the remainder when an integer A is divided by an integer B. Input The first line contains an integer T, the total number of test cases. Then T lines follow, each line contains two Integers A and B. Output For each test case, find the remainder when A is divided by B, and display it in a new line. Constraints - 1 ≤ T ≤ 1000 - 1 ≤ A,B ≤ 10000 ### Sample Test Cases *

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