백준 2745번: 진법 변환

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

1. 문제

진법 변환 문제

2. 알고리즘

키워드 - 구현, 진법 변환

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    string s; cin >> s;
    int b; cin >> b;
    reverse(s.begin(), s.end());
 
    const int size = s.size();
 
    ll sol = 0;
    for(int i =0; i<size; i++) {
        
        int cand = 1;
        for (int j = 0; j < i; j++)
            cand *= b;
 
        if (s[i] >= 'A' && s[i] <= 'Z') {
            sol += (10 + s[i] - 'A') * cand;
        } else {
            sol += (s[i] - '0') * cand;
        }
    }
 
    cout << sol << CENDL;
 
    return 0;
}