package dsa.level1;

import java.util.Scanner;

public class RotateNumber {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int k = sc.nextInt();
        int temp = n;
        int node =0;
        while(temp >0){
            temp = temp/10;
            node++;
        }

        k = k % node;

        int div = 1;
        int mult = 1;
        for(int i=1;i<=node;i++){
            if(i <=k){
                div = div * 10;
            }else{
                mult = mult * 10;
            }
        }
        
        System.out.println("div : "+div);
        System.out.println("mult : "+mult);

        int q = n/div;
        System.out.println("q : "+q);
        int r = n % div;
        System.out.println("r : "+r);
        System.out.println("r * mult plus  q " );
        int res = r * mult + q;
        System.out.println(res);


    }
}

Output : 
12345
2
div : 100
mult : 1000
q : 123
r : 45
r * mult plus  q 
45123

=== Code Execution Successful ===