Given a positive integer X and Y, the task is to find the last digit of X in the given base Y.
Examples:
Input: X = 10, Y = 7 Output: 3 10 is 13 in base 9 with last digit 3 Input: X = 55, Y = 3 Output: 1 55 is 3 in base 601 with last digit 1
Approach:
- When we try to convert X into the base Y
- We repeatedly divide X by base Y and store the remainder.
- So final result comprises of the remainders in the order of division steps.
- Lets say the remainder of division step 1 is p, step 2 is q, step 3 is r
- Then the resultant number in base Y will be rqp
- And the last digit will be p
- Therefore, we just need to find the first remainder of X when divided by Y to get the last digit in X in base Y.
last digit = X % Y
Below is the implementation of the above approach:
C++
// C++ Program to find// the last digit of X in base Y#include <bits/stdc++.h>using namespace std;// Function to find the last// digit of X in base Yvoid last_digit(int X, int Y){ cout << X % Y;}// Driver codeint main(){ int X = 55, Y = 3; last_digit(X, Y); return 0;} |
Java
// Java Program to find// the last digit of X in base Yimport java.io.*;public class GFG {// Function to find the last// digit of X in base Ystatic void last_digit(int X, int Y){ System.out.print(X % Y);}// Driver codepublic static void main(String []args){ int X = 55, Y = 3; last_digit(X, Y);}}// This code is contributed by Rajput-Ji |
Python3
# Python3 Program to find # the last digit of X in base Y # Function to find the last # digit of X in base Y def last_digit(X, Y) : print(X % Y); # Driver code if __name__ == "__main__" : X = 55; Y = 3; last_digit(X, Y);# This code is contributed # by AnkitRai01 |
C#
// C# Program to find the last digit// of X in base Yusing System;class GFG {// Function to find the last// digit of X in base Ystatic void last_digit(int X, int Y){ Console.Write(X % Y);}// Driver codepublic static void Main(String []args){ int X = 55, Y = 3; last_digit(X, Y);}}// This code is contributed by Rajput-Ji |
PHP
<?php// PHP Program to find the last digit // of X in base Y // Function to find the last // digit of X in base Y function last_digit($X,$Y){ echo( $X % $Y ); } // Driver code $X = 55;$Y = 3;last_digit($X,$Y); ?> |
Javascript
<script>// Javascript Program to find// the last digit of X in base Y// Function to find the last// digit of X in base Yfunction last_digit(X, Y){ document.write(X % Y);}// Driver codevar X = 55, Y = 3;last_digit(X, Y);</script> |
Output:
1
Time Complexity: O(1)
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
