[백준/C언어/C99] 2745번 진법 변환 | 단계별로 풀어보기

1. 문제

https://www.acmicpc.net/problem/2745

 

 

2. 풀이

#include <stdio.h>
#include <math.h>
#include <string.h>

int main(void) {

    int baseB;
    int resultOfBase10 = 0;
    char N[100];

    scanf("%s", N);
    scanf("%d", &baseB);

    int length = strlen(N);

    if(baseB >= 2 && baseB <= 36)
    {
        for (int i = 0; i < length; i++)
        {
            if(N[i] >= 65 && N[i] <= 90){
                // printf("%d번: %d\n", i, N[i]);
                resultOfBase10 += (N[i]-'A'+10) * pow(baseB, length-(i+1));
            } else {
                resultOfBase10 += (N[i]-'0') * pow(baseB, length-(i+1));
            }
        }
    }

    printf("%d", resultOfBase10);
}