1079 延迟的回文数 (20分)---再做

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
bool judge(string str){
    int k=str.size()/2;
    for(int i=0;i<k;i++){
        if(str[i]!=str[str.size()-1-i]) return false;
    }
    return true;
}
int main(){
    string str;
    int cnt=0;
    cin>>str;
    if(judge(str)){//易错
        cout<<str<<" is a palindromic number."<<endl;
        return 0;
    }
    for(int l=0;l<10;l++){
        string str2=str;
        reverse(str.begin(),str.end());
        string str1=str;
        int carry=0;
        for(int i=0;i<str.size();i++){
            str[i]=(str1[i]-'0'+str2[i]-'0'+carry)%10+'0';
            carry=(str1[i]-'0'+str2[i]-'0'+carry)/10;
        }
        if(carry>0) str+="1";
        reverse(str.begin(),str.end());
        cout<<str2<<" + "<<str1<<" = "<<str<<endl;
        cnt++;
        if(judge(str)==true){  //易错
            cout<<str<<" is a palindromic number."<<endl;
            return 0;
        }
    }
    cout<<"Not found in 10 iterations.\n";
    return 0;
}

第一次，独立完成，1h