提出 #67550662

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
long long a,n;

string base(long long x, long long a)
{
    string s="";
    while (x>0)
    {
        s += char('0' + x%a);
        x = x/a;
    }
    return s;
}

long long dx(string x)
{
    int o = 1;
    for (int i=0,j=x.size()-1; i<j; i++, j--)
        if (x[i] != x[j])
        {
            o = 0;
        }
    return o;
}



int main()
{
    cin >>a >>n;
    long long tong = 0;
    for (int l=1; l<=1000000; l++)
    {
        if (l>n)
            break;
        string s = to_string(l);
        string so2 = string(1,s[s.size()-1]);
        string so1 = s+so2;
        s.pop_back();
        so2 = s+so2;
        reverse(s.begin(),s.end());
        so1 += s;
        so2 += s;
        long long x = stoll(so1);
        long long y = stoll(so2);
        if (x<=n and dx(base(x,a)))
            tong += x;
        if (y<=n and dx(base(y,a)) and x != y)
            tong += y;
    }
    cout <<tong;
    return 0;
}

提出情報

ジャッジ結果