Problem B: Kaleidoscopic Palindromes

#include<bits/stdc++.h>
using namespace std;

bool isPalindromes(int a, int i){
    int nArray[(int)1e5+1], j = 0;
    while (a>0) {nArray[j++] = a%i; a/=i;}
    for (int k = 0; k<=j/2;++k)
        if (nArray[k] != nArray[j-k - 1]) return false;
    return true;
}

int main(){
    //fi("inp.txt"); //fo("out.txt");
    int a,b,k, ans=0; cin>>a>>b>>k;
    while (a<=b){
        bool ok = true;
        for (int i = 2;i<=k;++i) // 2 <= j <= k
            if (!isPalindromes(a, i)){ok=false; break;}

        ++a;
        if (ok) ++ans;
    }
    cout << ans;
}