提出 #67556854

---

ソースコード 拡げる

const readline = require('readline')

const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout
})
const lines = []
rl.on('line', (input) => {
    lines.push(input);
})
rl.on('close', () => {
// (function() {
    // const lines = require('fs').readFileSync('/dev/stdin', 'utf8').split('\n')
    let l = 0;
    let t = 1
    // t = +lines[l++]
    const output = []
    for (let i = 0; i < t; i++) {
        const a = +lines[l++]
        const n = +lines[l++]
        output[i] = solve(a, n)
    }
    console.log(output.join('\n'))
// })()
})

function solve(a, n) {
    let k = 0, v, b = 10
    let stopEven
    const cache = new Set()
    for (let i = 1; i < 1e6; i++) {
        const s = get(i, b)
        v = i
        for (let j = s.length - 2; j >= 0; j--) {
            v = v * b + s[j]
        }
        if (v <= n) {
            cache.add(v)
        } else {
            break
        }

        if (stopEven) continue
        v = i
        for (let j = s.length - 1; j >= 0; j--) {
            v = v * b + s[j]
        }
        if (v <= n) {
            cache.add(v)
        } else {
            stopEven = 1
        }
    }
    b = a, stopEven = 0
    for (let i = 1; i < 1600000; i++) {
        const s = get(i, b)
        v = i
        for (let j = s.length - 2; j >= 0; j--) {
            v = v * b + s[j]
        }
        if (v <= n) {
            if (cache.has(v)) k += v
        } else {
            break
        }

        if (stopEven) continue
        v = i
        for (let j = s.length - 1; j >= 0; j--) {
            v = v * b + s[j]
        }
        if (v <= n) {
            if (cache.has(v)) k += v
        } else {
            stopEven = 1
        }
    }
    return k
}
function val(o, b) {
    let r = 0
    for (let i = 0; i < o.length; i++) {
    // for (let i = o.length - 1; i >= 0; i--) {
        r = r * b + o[i]
    }
    return r
}
function get(x, b) {
    const o = []
    while (x > 0) {
        o.unshift(x % b)
        x = Math.floor(x / b)
    }
    return o
}
function isp(s) {
    for (let i = 0; i < s.length; i++) {
        if (s[i] !== s[s.length - 1 - i]) return 0
    }
    return 1
}

提出情報

ジャッジ結果