USACO-T009: Dual Palindromes

/*
ID: mickyta1
TASK: dualpal
LANG: C++
*/

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

string baseNumber(int x, int base){
    string ans = "";
    while(x > 0){
        int newDigit = x % base;
        if(newDigit >= 10){
            ans = (char)('A' + newDigit - 10) + ans;
        } else {
            ans = (char)('0' + newDigit) + ans;
        }
        x /= base;
    }
    return ans;
}

bool isPalindrome(string str){
    int len = str.size();
    for(int i = 0; i < len / 2; ++i){
        if(str[i] != str[len - i - 1]){
            return false;
        }
    }
    return true;
}

int main(){

    freopen("dualpal.in", "r", stdin);
    freopen("dualpal.out", "w", stdout);

    int st, limCnt;
    scanf("%d%d", &limCnt, &st);
    for(int i = st + 1; limCnt > 0; ++i){
        int cnt = 0;
        for(int b = 2; b <= 10; ++b){
            if(isPalindrome(baseNumber(i, b))){
                ++cnt;
                if(cnt == 2){
                    cout << i << '\n';
                    --limCnt;
                    break;
                }
            }
        }
    }

    fclose(stdin);
    fclose(stdout);

    return 0;
}