1136 A Delayed Palindrome （20 分）

Consider a positive integer N written in standard notation with k+1 digits a​i​​ as a​k​​⋯a​1​​a​0​​ with 0≤a​i​​<10 for all i and a​k​​>0. Then N is palindromic if and only if a​i​​=a​k−i​​ for all i. Zero is written 0 and is also palindromic by definition.

Non-palindromic numbers can be paired with palindromic ones via a series of operations. First, the non-palindromic number is reversed and the result is added to the original number. If the result is not a palindromic number, this is repeated until it gives a palindromic number. Such number is called a delayed palindrome. (Quoted from https://en.wikipedia.org/wiki/Palindromic_number )

Given any positive integer, you are supposed to find its paired palindromic number.

Input Specification:

Each input file contains one test case which gives a positive integer no more than 1000 digits.

Output Specification:

For each test case, print line by line the process of finding the palindromic number. The format of each line is the following:

A + B = C

where A is the original number, B is the reversed A, and C is their sum. A starts being the input number, and this process ends until C becomes a palindromic number -- in this case we print in the last line C is a palindromic number.; or if a palindromic number cannot be found in 10 iterations, print Not found in 10 iterations. instead.

Sample Input 1:

97152

Sample Output 1:

97152 + 25179 = 122331
122331 + 133221 = 255552
255552 is a palindromic number.

Sample Input 2:

196

Sample Output 2

196 + 691 = 887
887 + 788 = 1675
1675 + 5761 = 7436
7436 + 6347 = 13783
13783 + 38731 = 52514
52514 + 41525 = 94039
94039 + 93049 = 187088
187088 + 880781 = 1067869
1067869 + 9687601 = 10755470
10755470 + 07455701 = 18211171
Not found in 10 iterations.

 思路：其实就是简单模拟，首先判断改数字即字符串是不是回文字符串，这里的判断方法是:将字符串reverse(s.begin(),s.end()) C++STL里面的反转字符串，若相等则是回文字符串， 若不相等则将反转前后的字符串相加，这里涉及到一个问题就是 可以直接将字符串相加，也可以将字符串转为int再相加。字符串相加的时候就是要考虑进位的问题 ，若最后一位进位不为0，则需要加1

#include<stdio.h>
#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<algorithm>
#define ll long long 
using namespace  std;
const int maxn=10010;
string 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;

}
string revers(string s)
{
   reverse(s.begin(),s.end());
   return s;
}
int main()
{
	cin>>s;
	string sum;
	if(s==revers(s)) {cout<<s<<" is a palindromic number."<<endl;  return 0;}
	else
	{
		for(int i=0;i<10;i++)
		{
			sum=add(s,revers(s));
			cout<<s<<" + "<<revers(s)<<" = "<<sum<<endl;
		    if(sum==revers(sum))
			{
			  cout<<sum<<" is a palindromic number."<<endl;
              return 0;
			}
			s=sum;
		}
	}
	cout<<"Not found in 10 iterations."<<endl;
	return 0;
}