Submission #67537711

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define INF 0x7fffffff
#define inf 0x3f3f3f3f
#define endl '\n'
#define int long long
#define PII pair<int,int>
#define mod 998244353
const int MOD=1e9+7;
const int N=1e5+10;
int read() {char act = 0;int f = 1, x= 0;while (act = getchar(), act < '0' && act != '-');if (act == '-') f = -1, act = getchar();x = act - '0';while (act = getchar(), act >= '0') x = x * 10 + act - '0';return x * f;}
int flip(int n) {
    if (n == 0)
        return 0;
    int rev = 0;
    while (n) {
        rev = rev * 10 + n % 10;
        n /= 10;
    }
    return rev;
}
bool check(int num, int A) {
    if (num == 0) {
        return true;
    }
    vector<int> digit;
    int n = num;
    while (n) {
        digit.push_back(n % A);
        n /= A;
    }
    int len = digit.size();
    for (int i = 0; i < len/2; i++) {
        if (digit[i] != digit[len-1-i]) {
            return false;
        }
    }
    return true;
}
void solve(){
    int pow10[15];
    pow10[0] = 1;
    for (int i = 1; i < 15; i++) {
        pow10[i] = pow10[i-1] * 10;
    }
    int A,N;
    cin >> A >> N;
    int sum = 0,d_max = 0,temp = N;
    while (temp) {
        d_max++;
        temp /= 10;
    }
    for (int d = 1; d <= d_max; d++) {
        int half_len = (d + 1) / 2;
        int low = pow10[half_len - 1];
        int high = pow10[half_len] - 1;

        for (int x = low; x <= high; x++) {
            int num;
            if (d % 2 == 0) {
                int rev = flip(x);
                num = x * pow10[d / 2] + rev;
            } else {
                int y = x / 10;
                int rev = flip(y);
                num = x * pow10[half_len - 1] + rev;
            }
            if (num > N) {
                break;
            }
            if (check(num, A)) {
                sum += num;
            }
        }
    }
    cout << sum << endl;
}
signed main()
{
    IOS;
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }

    return 0;
}

Submission Info

Judge Result