C++ Program to Rotate digits of a given number by K

// C++ program to implement
// the above approach

#include <bits/stdc++.h>
using namespace std;

// Function to find the count of
// digits in N
int numberOfDigit(int N)
{

    // Stores count of
    // digits in N
    int digit = 0;

    // Calculate the count
    // of digits in N
    while (N > 0) {

        // Update digit
        digit++;

        // Update N
        N /= 10;
    }
    return digit;
}

// Function to rotate the digits of N by K
void rotateNumberByK(int N, int K)
{

    // Stores count of digits in N
    int X = numberOfDigit(N);

    // Update K so that only need to
    // handle left rotation
    K = ((K % X) + X) % X;

    // Stores first K digits of N
    int left_no = N / (int)(pow(10, X - K));

    // Remove first K digits of N
    N = N % (int)(pow(10, X - K));

    // Stores count of digits in left_no
    int left_digit = numberOfDigit(left_no);

    // Append left_no to the right of
    // digits of N
    N = (N * (int)(pow(10, left_digit))) + left_no;
    cout << N;
}

// Driver code
int main()
{
    int N = 12345, K = 7;

    // Function Call
    rotateNumberByK(N, K);
    return 0;
}

// The code is contributed by Dharanendra L V