Encuentra el resto cuando el primer dígito de un número se divide por su último dígito

Dado un número N, encuentre el resto cuando el primer dígito de N se divide por su último dígito.
Ejemplos: 

Input: N = 1234
Output: 1
First digit = 1
Last digit = 4
Remainder = 1 % 4 = 1

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

Planteamiento: Encuentra el primer dígito y el último dígito del número. Encuentre entonces el resto cuando el primer dígito se divide por el último dígito.
A continuación se muestra la implementación del enfoque anterior:  

// 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;
}

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

# 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

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

<script>
 
 // Javascript  program to find the remainder
// when the First digit of a number
// is divided by its Last digit
 
// Function to find the remainder
function findRemainder( n)
{
    // Get the last digit
    let  l = n % 10;
 
    // Get the first digit
    while (n >= 10)
        n /= 10;
    let f = n;
    // Compute the remainder
    let remainder = f % l;
 
    document.write(Math.floor(remainder));
}
 
// Driver code
    let n = 5223;
    findRemainder(n);
 
 
// This code is contributed by mohan pavan
 
</script>

2

Complejidad de tiempo: O(L) donde L es la longitud del número en representación decimal

Espacio Auxiliar: O(1)