1136 A Delayed Palindrome

#include<iostream>
#include<algorithm>
using namespace std;
//进行翻转
string rev(string s){
reverse(s.begin(),s.end());
return s;
}
//进行加法运算
string add(string s1,string s2){
string s=s1;
int carry=0;//进位
for(int i=s1.size()-1;i>=0;i--){
s[i]=(s1[i]-'0'+s2[i]-'0'+carry)%10+'0';
carry=(s1[i]-'0'+s2[i]-'0'+carry)/10;
}
if(carry>0){
s="1"+s;
}
return s;
}
int main(){
string s,sum;
cin>>s>>sum;
int n=10;
if(s==rev(s)){
cout<<s<<" is a palindromic number."<<endl;
return 0;
}
while(n--){
sum=add(s,rev(s));
cout<<s<<" + "<<rev(s)<<" = "<<sum<<endl;
if(sum==rev(sum)){
cout<<sum<<" is a palindromic number."<<endl;
return 0;
}
s=sum;
}
cout<<"Not found in 10 iterations."<<endl;
return 0;
}