1079 延迟的回文数

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

bool isPalindromicNumber(const string& str) {//判断是否是回文数
    int n = str.size();
    for(int i = 0; i < n/2; ++i)
        if(str[i] != str[n-1-i]) return false;
    return true;
}

int main() {
    string str;
    cin>>str;
    int i;
    for(i = 0; i < 10; ++i) {
        if(isPalindromicNumber(str)) {
            printf("%s is a palindromic number.",str.c_str());
            break;
        }
        string temp = str;
        reverse(temp.begin(),temp.end());
        printf("%s + %s = ",str.c_str(),temp.c_str());
        string result;
        int carry = 0;
        for(int i = str.size()-1; i >= 0; --i) {
            result += (str[i]-‘0‘+temp[i]-‘0‘+carry)%10 +‘0‘;
            carry = (str[i]-‘0‘+temp[i]-‘0‘+carry)/10;
        }
        if(carry != 0) result += carry +‘0‘;
        reverse(result.begin(),result.end());
        printf("%s\n",result.c_str());
        str = result;
    }
    if(i == 10)
        printf("Not found in 10 iterations.");
    return 0;
}