Find Remainder | Codechef solution

Problem (Find Remainder | Codechef solution):-

Write a program to find the remainder when an integer A is divided by an integer B.

Input of Find Remainder | Codechef solution

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:-

 

• Primary test
• Sum or difference
• point and line

 

Wipro :-

 

• Update the booking ID | Wipro previous year question paper solution
• Pages in PDF
• Find the location id
• Find the odd digits
• Find the Product ID

 

Infytq :-

 

• Matrix sum | Infytq solution
• Counting frequency of the character by using map function

 

Key Points;-

Hackerrank:-

C-tutorial:-

 

• Micros in C
• Pointer in c
• Function declaration
• Types of user define function
• return type of function
• 2D array

See more:-

 

• c program to convert specified days into years weeks and days
  
• Print Reverse Hollow Pyramid
• Update the booking ID | Wipro previous year question paper
• Pages in PDF | Wipro previous year question paper
• Sparse Matrix in data structure
• Find the location ID | Wipro previous year Coding question
• find the odd digits | Wipro Coding question
• Find the product id | Wipro Coding question
• Difference between static and dynamic memory allocation
• What is asymptotic Notation