# Find the remainder when First digit of a number is divided by its Last digit

Given a number N, find the remainder when the first digit of N is divided by its last digit.

**Examples:**

Input:N = 1234Output:1 First digit = 1 Last digit = 4 Remainder = 1 % 4 = 1Input:N = 5223Output:2 First digit = 5 Last digit = 3 Remainder = 5 % 3 = 2

**Approach:** Find the first digit and the last digit of the number. Find then the remainder when the first digit is divided by the last digit.

Below is the implementation of the above approach:

## C++

`// C++ program to find the remainder ` `// when the First digit of a number ` `// is divided by its Last digit ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find the remainder ` `void` `findRemainder(` `int` `n) ` `{ ` ` ` `// Get the last digit ` ` ` `int` `l = n % 10; ` ` ` ` ` `// Get the first digit ` ` ` `while` `(n >= 10) ` ` ` `n /= 10; ` ` ` `int` `f = n; ` ` ` ` ` `// Compute the remainder ` ` ` `int` `remainder = f % l; ` ` ` ` ` `cout << remainder << endl; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` ` ` `int` `n = 5223; ` ` ` ` ` `findRemainder(n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find the remainder ` `// when the First digit of a number ` `// is divided by its Last digit ` `class` `GFG ` `{ ` ` ` `// Function to find the remainder ` `static` `void` `findRemainder(` `int` `n) ` `{ ` ` ` `// Get the last digit ` ` ` `int` `l = n % ` `10` `; ` ` ` ` ` `// Get the first digit ` ` ` `while` `(n >= ` `10` `) ` ` ` `n /= ` `10` `; ` ` ` `int` `f = n; ` ` ` ` ` `// Compute the remainder ` ` ` `int` `remainder = f % l; ` ` ` ` ` `System.out.println(remainder); ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `n = ` `5223` `; ` ` ` `findRemainder(n); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to find the remainder ` `# when the First digit of a number ` `# is divided by its Last digit ` ` ` `# Function to find the remainder ` `def` `findRemainder(n): ` ` ` ` ` `# Get the last digit ` ` ` `l ` `=` `n ` `%` `10` ` ` ` ` `# Get the first digit ` ` ` `while` `(n >` `=` `10` `): ` ` ` `n ` `/` `/` `=` `10` ` ` `f ` `=` `n ` ` ` ` ` `# Compute the remainder ` ` ` `remainder ` `=` `f ` `%` `l ` ` ` ` ` `print` `(remainder) ` ` ` `# Driver code ` `n ` `=` `5223` ` ` `findRemainder(n) ` ` ` `# This code is contributed by Mohit Kumar ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find the remainder ` `// when the First digit of a number ` `// is divided by its Last digit ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` `// Function to find the remainder ` `static` `void` `findRemainder(` `int` `n) ` `{ ` ` ` `// Get the last digit ` ` ` `int` `l = n % 10; ` ` ` ` ` `// Get the first digit ` ` ` `while` `(n >= 10) ` ` ` `n /= 10; ` ` ` `int` `f = n; ` ` ` ` ` `// Compute the remainder ` ` ` `int` `remainder = f % l; ` ` ` ` ` `Console.WriteLine(remainder); ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main() ` `{ ` ` ` `int` `n = 5223; ` ` ` `findRemainder(n); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

**Output:**

2

## Recommended Posts:

- Program to find remainder when large number is divided by 11
- Program to find remainder when large number is divided by r
- Count of Numbers in Range where first digit is equal to last digit of the number
- Largest number less than N with digit sum greater than the digit sum of N
- Largest number by which given 3 numbers should be divided such that they leaves same remainder
- Find the Number which contain the digit d
- Minimum number of operations on a binary string such that it gives 10^A as remainder when divided by 10^B
- Find nth number that contains the digit k or divisible by k.
- Find the frequency of a digit in a number
- Find minimum possible digit sum after adding a number d
- Program to find last digit of n'th Fibonnaci Number
- Find last five digits of a given five digit number raised to power five
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Count 'd' digit positive integers with 0 as a digit
- Check if frequency of each digit is less than the digit

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.