mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-25 05:22:39 +08:00
36 lines
858 B
Java
36 lines
858 B
Java
package com.thealgorithms.conversions;
|
|
|
|
import java.util.Scanner;
|
|
|
|
// given a source number , source base, destination base, this code can give you the destination
|
|
// number.
|
|
// sn ,sb,db ---> ()dn . this is what we have to do .
|
|
|
|
public final class AnytoAny {
|
|
private AnytoAny() {
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
Scanner scn = new Scanner(System.in);
|
|
int sn = scn.nextInt();
|
|
int sb = scn.nextInt();
|
|
int db = scn.nextInt();
|
|
int m = 1;
|
|
int dec = 0;
|
|
int dn = 0;
|
|
while (sn != 0) {
|
|
dec = dec + (sn % 10) * m;
|
|
m *= sb;
|
|
sn /= 10;
|
|
}
|
|
m = 1;
|
|
while (dec != 0) {
|
|
dn = dn + (dec % db) * m;
|
|
m *= 10;
|
|
dec /= db;
|
|
}
|
|
System.out.println(dn);
|
|
scn.close();
|
|
}
|
|
}
|