Header Ads Widget

Find Remainder | Codechef solution

Rajnish Tripathi 19:30

  Problem:-

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

Example

Input
3 
1 2
100 200
40 15

Output
1
100
10

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);
        // Compute the ans.
        // Complete the below line.
        int ans = a%b;
        printf("%d\n", ans);
    }

    return 0;
}

Recommended Post:

Cracking the coding interview:-

 Array and string:-

Tree and graph:-

Hackerearth Problems:-

Hackerrank Problems:-

Data structure:-

Key points:-

 MCQs:-

Tags:

Post a Comment

0 Comments