304 North Cardinal St.
Dorchester Center, MA 02124

# 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

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.

•  T  1000
•  A,B  10000

### Sample 1:

``````Input: 3
1 2
100 200
40 15
Output: 1
100
10``````

### Find Remainder CodeChef Solution in C++17

``````#include<iostream>
using namespace std;
int main(){
int T;
cin>>T;
while(T--){
int A,B;
cin>>A>>B;
cout<<A%B<<endl;
}
return 0;
}

``````

### Find Remainder CodeChef Solution in Pyth 3

``````T = int(input())
for x in range(T):
A,B = map(int, input().split())
print(A % B)``````

### Find Remainder CodeChef Solution in Java

``````import java.util.*;
class Remainder
{
public static void main(String args[])
{
Scanner s = new Scanner(System.in);
int t = s.nextInt();
for(int i=0;i<t;i++)
{
int a = s.nextInt();
int b = s.nextInt();
System.out.println(a%b);
}
}
}

``````
##### Find Remainder CodeChef Solution Review:

In our experience, we suggest you solve this Find Remainder CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Find Remainder CodeChef Solution

Find on CodeChef

##### Conclusion:

I hope this Find Remainder CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions