Find Remainder CodeChef Solution

Find Remainder CodeChef Solution

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.

Example

Input
3 
1 2
100 200
40 15

Output
1
100
10

Source Code:

#include <bits/stdc++.h>

using namespace std;

int main() {
// Read the number of test cases.
int T;
scanf(“%d”, &T);
while (T–) {
// Read the input a, b
int a, b;
scanf(“%d %d”, &a, &b);

int ans = a%b;
printf(“%d\n”, ans);
}

return 0;
}

Harsh

Hey Friends, Welcome to thetechbuddy. This blog is about technical or programming knowledge.

Leave a Reply