1024 Palindromic Number

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
string n;
int k, t = 0;
vector<int>a;
bool ispalindromic(vector<int>num) {
    int i;
    for (i = 0; 2 * i <= num.size() - 1; i++) {
        if (num[i] != num[num.size() - 1 - i]) {
            return false;
        }
    }
    return true;
}
vector<int> aplus(vector<int>m) {
    int i;
    bool add = false;
    vector<int>fm(m);
    reverse(m.begin(),m.end());
    vector<int>r;
    for (i = 0; i <= m.size() - 1; i++) {
        int p;
        p = m[i] + fm[i];
        p=(add)?p+1:p;
        r.push_back(p % 10);
        add = (p >= 10);
    }
    if (add)
        r.push_back(1);
    return r;
}
int main() {
    cin >> n >> k;
    int i;
    for (i = n.size() - 1; i >= 0; i--)
        a.push_back(n[i] - '0');
    while (!ispalindromic(a)) {
        a = aplus(a);
        t++;
        if (t >= k)
            break;
    }
    for (i = a.size() - 1; i >= 0; i--)
        cout << a[i];
    cout << endl;
    cout << t;
    return 0;
}