Submission #67559564

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using int128 = __int128;
using State = string::const_iterator;
class ParseError {};
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define reps(i, l, r) for(ll i = (l); i < (r); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define endl "\n";
const ll INF = LLONG_MAX / 4;
const ld inf = numeric_limits<long double>::max() / (ld)4;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
const ld pi = 3.1415926535897;
ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
ll dy[8] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) { a = b; return true; }
    return false;
}
void solve() {
    ll A; cin >> A;
    ll N; cin >> N;
    unsigned long long ans = 0;
    reps(i, 1, 1000000) {
        string v = to_string(i);
        string rev = v; reverse(rev.begin(), rev.end());
        string S = v + rev;
        string T = v + rev.substr(1, T.size() - 1);
        ll s = stoll(S), t = stoll(T);
        bool check1 = (s <= N), check2 = (t <= N);
        string Sa, Ta;
        while (s != 0) {
            Sa.push_back(char('0' + (s % A)));
            s /= A;
        }
        while (t != 0) {
            Ta.push_back(char('0' + (t % A)));
            t /= A;
        }
        string revSa = Sa, revTa = Ta;
        reverse(revSa.begin(), revSa.end());
        reverse(revTa.begin(), revTa.end());
        if (check1 && Sa == revSa) {ans += stoll(S);}
        if (check2 && Ta == revTa) {ans += stoll(T);}
        // cout << s << endl;
    }
    cout << ans << endl;
}
int main() {
    ll T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
}

Submission Info

Judge Result