#include<bits/stdc++.h>
using namespace std;
string rse(string a)
{
reverse(a.begin(),a.end());
return a;
}
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()
{
int count=0;
string a;
cin>>a;
while(a!=rse(a)&&count<10)
{
cout<<a<<" + "<<rse(a)<<" = "<<add( a,rse(a))<<endl;
count++;
a=add(a,rse(a));
}
if(count<10&&a==rse(a))
{
cout<<a<<" is a palindromic number."<<endl;
}
if(count>=10)
{
cout<<"Not found in 10 iterations."<<endl;
}
}
1079 延迟的回文数
最新推荐文章于 2024-07-23 18:35:33 发布