๐Ÿ•ธ Algorithm/๐Ÿ•ธ ๋ฐฑ์ค€ BaekJoon

[๋ฐฑ์ค€][java][11005][์ง„๋ฒ• ๋ณ€ํ™˜ 2]

yeun.log 2024. 3. 13. 01:39
๋ฐ˜์‘ํ˜•

 

import java.util.Scanner;

// 	11005	์ง„๋ฒ• ๋ณ€ํ™˜ 2
public class Main {

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

        int n = in.nextInt();   // 10์ง„๋ฒ• ์ˆ˜
        int b = in.nextInt();   // ์ง„๋ฒ•
        in.close();

        StringBuilder sb = new StringBuilder();

        while (n != 0) {
            int last = n % b;

            String res = "";

            if (last >= 10 ) {
                char c = (char) ((int) last + 55);
                res = Character.toString(c);
            }
            else {
                res = Integer.toString(last);
            }
            
            n /= b;

            sb.append(res);
        }
        System.out.print(sb.reverse().toString());
    }
}
  • ์ˆ˜ % ์ง„๋ฒ•์˜ ๋‚˜๋จธ์ง€ ๊ฐ’์„ 10์ง„์ˆ˜๋กœ ํ‘œํ˜„ํ•˜๋Š”๋ฐ
  • ์ด๋•Œ ๋‚˜๋จธ์ง€ ๊ฐ’์ด 0~9์˜ ์ˆ˜. 10์ง„์ˆ˜์ด๋ฉด ๊ทธ๋Œ€๋กœ ์ถœ๋ ฅ
  • ์•„๋‹ˆ๋ฉด +55(Ascill์ฝ”๋“œ์—์„œ 'A'๊ฐ’)๋ฅผ ๋”ํ•ด char๋กœ ํ˜•๋ณ€ํ™˜ ํ›„ ์ถœ๋ ฅ
  • ์ถœ๋ ฅ์‹œ ๋ฌธ์ž์—ด์„ ๋ฐ˜์ „์‹œ์ผœ ๋‚ด๋ณด๋‚ด๋ฉด ๋ฉ๋‹ˆ๋‹ค.
๋ฐ˜์‘ํ˜•