Submission #67546369

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool shi(ll b) {
    if (b < 0) return false;
    ll c = 0, d = b;
    while (b > 0) {
        c = c * 10 + b % 10;
        b /= 10;
    }
    return c == d;
}
bool c(ll x, ll base) {
    if (x == 0) return true;
    vector<int> digits;
    ll t = x;
    while (t > 0) {
        digits.push_back(t % base);
        t /= base;
    }
    int l = 0, r = digits.size() - 1;
    while (l < r) {
        if (digits[l] != digits[r]) 
            return false;
        l++;
        r--;
    }
    return true;
}
int main() {
    ll a, n, e = 0;
    cin >> a >> n;
    int len = to_string(n).size();
    for (int d = 1; d <= len; d++) {
        int half = (d + 1) / 2;
        ll start = pow(10, half - 1);
        ll end = pow(10, half) - 1;
        for (ll j = start; j <= end; j++) {
            ll pal = j;
            ll temp = (d % 2 == 1) ? j / 10 : j;
            ll x = temp;
            while (x > 0) {
                pal = pal * 10 + (x % 10);
                x /= 10;
            }
            if (pal > n) break;
            if (shi(pal) && c(pal, a)) {
                e += pal;
            }
        }
    }
    cout << e;
    return 0;
}

Submission Info

Judge Result