Submission #67524033

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

bool judge(ll x, int a){
    vector<int> y;
    while(x){
        y.emplace_back(x%a);
        x /= a;
    }
    auto z = y;
    reverse(all(z));
    return z==y;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll a,n;
    cin >> a >> n;
    ll ans = 0;
    for(ll i=1;;++i){
        string s = to_string(i);
        auto t = s;
        reverse(all(t));
        auto p = stoll(s+t);
        auto q = stoll(s.substr(0,(int)s.size()-1)+t);
        if(q>n) break;
        if(p<=n) ans += p * judge(p,a);
        ans += q * judge(q,a);
    }
    cout << ans << '\n';
    return 0;
}

Submission Info

Judge Result