Generate all rotations of a number
Given an integer n, the task is to generate all the left shift numbers possible. A left shift number is a number that is generated when all the digits of the number are shifted one position to the left and the digit at the first position is shifted to the last.
Examples:
Input: n = 123
Output: 231 312Input: n = 1445
Output: 4451 4514 5144
Approach:
- Assume n = 123.
- Multiply n with 10 i.e. n = n * 10 = 1230.
- Add the first digit to the resultant number i.e. 1230 + 1 = 1231.
- Subtract (first digit) * 10k from the resultant number where k is the number of digits in the original number (in this case, k = 3).
- 1231 – 1000 = 231 is the left shift number of the original number.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the count of digits of n int numberOfDigits(int n) { int cnt = 0; while (n > 0) { cnt++; n /= 10; } return cnt; } // Function to print the left shift numbers void cal(int num) { int digits = numberOfDigits(num); int powTen = pow(10, digits - 1); for (int i = 0; i < digits - 1; i++) { int firstDigit = num / powTen; // Formula to calculate left shift // from previous number int left = ((num * 10) + firstDigit) - (firstDigit * powTen * 10); cout << left << " "; // Update the original number num = left; } } // Driver Code int main() { int num = 1445; cal(num); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function to return the count of digits of n static int numberOfDigits(int n) { int cnt = 0; while (n > 0) { cnt++; n /= 10; } return cnt; } // Function to print the left shift numbers static void cal(int num) { int digits = numberOfDigits(num); int powTen = (int) Math.pow(10, digits - 1); for (int i = 0; i < digits - 1; i++) { int firstDigit = num / powTen; // Formula to calculate left shift // from previous number int left = ((num * 10) + firstDigit) - (firstDigit * powTen * 10); System.out.print(left + " "); // Update the original number num = left; } } // Driver Code public static void main(String[] args) { int num = 1445; cal(num); } } // This code is contributed by // PrinciRaj1992 |
chevron_right
filter_none
Python3
# Python3 implementation of the approach # function to return the count of digit of n def numberofDigits(n): cnt = 0 while n > 0: cnt += 1 n //= 10 return cnt # function to print the left shift numbers def cal(num): digit = numberofDigits(num) powTen = pow(10, digit - 1) for i in range(digit - 1): firstDigit = num // powTen # formula to calculate left shift # from previous number left = (num * 10 + firstDigit - (firstDigit * powTen * 10)) print(left, end = " ") # Update the original number num = left # Driver code num = 1445cal(num) # This code is contributed # by Mohit Kumar |
chevron_right
filter_none
C#
// C# implementation of the approach using System; public class GFG{ // Function to return the count of digits of n static int numberOfDigits(int n) { int cnt = 0; while (n > 0) { cnt++; n /= 10; } return cnt; } // Function to print the left shift numbers static void cal(int num) { int digits = numberOfDigits(num); int powTen = (int)Math.Pow(10, digits - 1); for (int i = 0; i < digits - 1; i++) { int firstDigit = num / powTen; // Formula to calculate left shift // from previous number int left = ((num * 10) + firstDigit) - (firstDigit * powTen * 10); Console.Write(left + " "); // Update the original number num = left; } } // Driver Code static public void Main (){ int num = 1445; cal(num); } } // This code is contributed by akt_mit.... |
chevron_right
filter_none
PHP
<?php // PHP implementation of the approach // Function to return the count // of digits of n function numberOfDigits($n) { $cnt = 0; while ($n > 0) { $cnt++; $n = floor($n / 10); } return $cnt; } // Function to print the left shift numbers function cal($num) { $digits = numberOfDigits($num); $powTen = pow(10, $digits - 1); for ($i = 0; $i < $digits - 1; $i++) { $firstDigit = floor($num / $powTen); // Formula to calculate left shift // from previous number $left = (($num * 10) + $firstDigit) - ($firstDigit * $powTen * 10); echo $left, " "; // Update the original number $num = $left; } } // Driver Code $num = 1445; cal($num); // This code is contributed by Ryuga ?> |
chevron_right
filter_none
Output:
4451 4514 5144
Recommended Posts:
- Check whether all the rotations of a given number is greater than or equal to the given number or not
- Find element at given index after a number of rotations
- Generate all cyclic permutations of a number
- Generate number with given operation and check if it is palindrome
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Check if strings are rotations of each other or not | Set 2
- Count rotations divisible by 8
- Check if two numbers are bit rotations of each other or not
- Count rotations divisible by 4
- Maximum sum of i*arr[i] among all rotations of a given array
- Generating numbers that are divisor of their right-rotations
- Minimum rotations required to get the same string
- Minimum rotations to unlock a circular lock
- Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed
- Check if all rows of a matrix are circular rotations of each other
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.