DEV Community

Cover image for How to Encrypt Numbers by Reordering Digits
Arul .A
Arul .A

Posted on

How to Encrypt Numbers by Reordering Digits

1.123456 INTO 563412 :

-In python :

no=123456
rev=0
while no>0:
  rev=rev*100+no%100
  no=no//100
print(rev)
Enter fullscreen mode Exit fullscreen mode

-In JavaScript :

no=123456
rev=0
while (no>0){
  rev=rev*100+no%100
  no=Math.floor(no/100)
}
console.log(rev)
Enter fullscreen mode Exit fullscreen mode

-In Java :

import java.util.*;

public class Main {

    public int reverse(int no, int rev) {
        while (no > 0) {
            rev = rev * 100 + no % 100;
            no = no / 100;
        }
        return rev;
    }

    public static void main(String[] args) {
        Main s = new Main();
        System.out.println(s.reverse(123456, 0));
    }
}

Enter fullscreen mode Exit fullscreen mode

Output:

1.123456 INTO 456123 :

-In python :

no=123456
rev=0
while no>0:
  rev=rev*1000+no%1000
  no=no//1000
print(rev)
Enter fullscreen mode Exit fullscreen mode

-In JavaScript :

no=123456
rev=0
while (no>0){
  rev=rev*1000+no%1000
  no=Math.floor(no/1000)
}
console.log(rev)
Enter fullscreen mode Exit fullscreen mode

-In Java :

import java.util.*;

public class Main {

    public int reverse(int no, int rev) {
        while (no > 0) {
            rev = rev * 1000 + no % 1000;
            no = no / 1000;
        }
        return rev;
    }

    public static void main(String[] args) {
        Main s = new Main();
        System.out.println(s.reverse(123456, 0));
    }
}

Enter fullscreen mode Exit fullscreen mode

Output :

3.123456 - 135246 :

-In Python :

no = 123456
no1 = 100000
result1 = ""  
result2 = ""  

while no > 0 and no1 >= 1:
    res = no // no1
    res1 = res % 10
    result1 += str(res1)      
    no = no % no1
    no1 = no1 // 10           

    if no > 0 and no1 >= 1:
        res = no // no1
        res2 = res % 10
        result2 += str(res2)  
        no = no % no1
        no1 = no1 // 10

result = result1 + result2
print(result)
Enter fullscreen mode Exit fullscreen mode

Output :

-In JavaScript :

let no = 123456;
let no1 = 100000;
let result1 = "";
let result2 = "";

while (no > 0 && no1 >= 1) {
    let res = Math.floor(no / no1);
    let res1 = res % 10;
    result1 += String(res1);
    no = no % no1;
    no1 = Math.floor(no1 / 10);

    if (no > 0 && no1 >= 1) {
        res = Math.floor(no / no1);
        let res2 = res % 10;
        result2 += String(res2);
        no = no % no1;
        no1 = Math.floor(no1 / 10);
    }
}

let result = result1 + result2;
console.log(result);  
Enter fullscreen mode Exit fullscreen mode

-In Java:

public class Main {
    public static void main(String[] args) {
        int no = 123456;
        int no1 = 100000;
        String result1 = "";
        String result2 = "";

        while (no > 0 && no1 >= 1) {
            int res = no / no1;
            int res1 = res % 10;
            result1 += String.valueOf(res1);
            no = no % no1;
            no1 = no1 / 10;

            if (no > 0 && no1 >= 1) {
                res = no / no1;
                int res2 = res % 10;
                result2 += String.valueOf(res2);
                no = no % no1;
                no1 = no1 / 10;
            }
        }

        String result = result1 + result2;
        System.out.println(result);  // 135246
    }
}
Enter fullscreen mode Exit fullscreen mode

Top comments (0)