A125.数列

#include<bits/stdc++.h>
using namespace std;
#define ll long long


ll powk[19];
int main() {
    powk[0] = 1;
    ll k, n;
    cin >> k >> n;
    for (int i = 1; i <= 11; i++) powk[i] = powk[i-1]*k;
    ll ans = 0;
    for (int i = 0; i <= 11; i++) {
        if (n >> i & 1) {
            ans += powk[i];
        }
    }
    cout << ans;
    return 0;
}