package k20231205;

import java.util.Arrays;
import java.util.Iterator;
import java.util.Scanner;
public class ConvertTest4Self {
public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);
System.out.println("10진수를 입력하세요: ");
int dec = scanner.nextInt();
System.out.println("변환할 진수를 입력하세요: ");
int n = scanner.nextInt();
int number = dec;
int[] hex = new int[8];
int index = 0;
while (true) {
int m = dec / n;
int r = dec % n;
hex[index++] = r;
if (m==0) {
break;
}
dec = m;
}
// n진 각 자리수를 기억하는 배열을 선언한다
// char[] h = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};
System.out.print(number + "를(을) " + n +"진수로 변환하면 ");
for (int i = index-1; i >= 0; i--) {
if (hex[i]>=36) {
System.out.print((char)(hex[i]+61));
} else if ((hex[i]>=10)){
System.out.print((char)(hex[i]+55));
} else
System.out.print(hex[i]);
}
System.out.println(" 입니다.");
}
}
'java&eclipse 코딩 알고리즘 > 20231205' 카테고리의 다른 글
| EuclideanAlgorithm2 (0) | 2023.12.14 |
|---|---|
| EuclideanAlgorithm (0) | 2023.12.14 |
| ConvertTest3 (0) | 2023.12.14 |
| ConvertTest2 (0) | 2023.12.14 |
| ConvertTest (0) | 2023.12.14 |