algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-08 18:32:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #400 from khalil2535/master

Browse Source 
Thanks for the changes! I maintain this repository only recently.
This commit is contained in:
Christian Bender
2018-04-02 15:06:46 +02:00
committed by GitHub
parent dba791e515 e6766a92d6
commit d2c944387e
1 changed files with 23 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
Conversions/AnytoAny.java
View File

@ -1,28 +1,29 @@
package Java.Conversions;
import java.util.Scanner; import java.util.Scanner;
//given a source number , source base, destination base, this code can give you the destination number. //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 . //sn ,sb,db ---> ()dn . this is what we have to do .
public class anytoany {
public static void main(String[] args) { public class AnytoAny {
Scanner scn = new Scanner(System.in);
int sn = scn.nextInt(); public static void main(String[] args) {
int sb = scn.nextInt(); Scanner scn = new Scanner(System.in);
int db = scn.nextInt(); int sn = scn.nextInt();
int m=1,dec=0,dn=0; int sb = scn.nextInt();
while(sn!=0) int db = scn.nextInt();
{ int m = 1, dec = 0, dn = 0;
dec=dec+ (sn%10)*m; while (sn != 0) {
m*=sb; dec = dec + (sn % 10) * m;
sn/=10; m *= sb;
} sn /= 10;
m=1; }
while(dec!=0) m = 1;
{ while (dec != 0) {
dn=dn+ (dec%db)*m; dn = dn + (dec % db) * m;
m*=10; m *= 10;
dec/=db; dec /= db;
} }
System.out.println(dn); System.out.println(dn);
} }
} }