PAT1024

题目链接：http://pat.zju.edu.cn/contests/pat-a-practise/1024

注意一点，必须要用字符串，long long 也会溢出！

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;

bool palindromic(string n)
{
    string n1(n);
    reverse(n.begin(), n.end());
    if(n1 == n)
        return true;
    else
        return false;
}

string process(string n)
{
    string n1(n);
    reverse(n.begin(), n.end());
    int carry(0);
    string outcome;
    for(int i=n1.size()-1; i>=0; --i)
    {
        int k=(n[i]-'0')+(n1[i]-'0')+carry;
        carry=0;
        if(k >= 10)
            {carry = 1; k-=10;}
        outcome.push_back((char)(k+'0'));
    }
    if(carry == 1)
        outcome.push_back('1');
    reverse(outcome.begin(), outcome.end());
    return outcome;
}

int main()
{
    string n;
    int k;
    while(cin>>n>>k)
    {
        int m(0);
        while(m <= k)
            if(palindromic(n))
            {
                cout<<n<<endl<<m<<endl;
                break;
            }
            else if(m == k)
            {
                cout<<n<<endl<<m<<endl;
                break;
            }
            else
            {
                n=process(n);
                ++m;
            }
    }
    return 0;
}