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.

做此题的时候注意不可以直接用加法，因为最后一个测试点太大（其实题中已经告诉，数字不超过1000位，明显想让我们模拟加法，我偷懒想用longlong AC，结果还是失败55555），我用了longlong还是没过，最后还是写了个模拟加法

AC代码：

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
	string a,b;
	int sum;
	cin >> a;
	int cnt = 0;
	while(cnt<10){
		b = a;
		reverse(b.begin(),b.end());
		long long u,v,sum;
		if(b == a){
			cout << a << " is a palindromic number." << endl;
			return 0;
		}else{
			int flag = 0;
			int top = 0;
			vector<int> v(100005,0);
			string c;
			for(int i = a.length()-1;i >= 0;i--){
				int num;
				num = (a[i]-'0')+(b[i]-'0')+v[top];
				//cout << num << endl;
				if(num >= 10){
					v[top+1]+=1;
					num = num-10;
					if(i==0){
						flag=1;
					}
				}
				v[top++] = num;
			}
			if(flag){
				top++;
			}
			for(int i = 0;i < top;i++){
				c+=(v[i]+'0');
			}
			reverse(c.begin(),c.end());
			cout << a << " + " << b << " = " << c << endl;
			a = c;
			cnt++;
		}
	}
	cout << "Not found in 10 iterations." << endl;
	return 0;
} 

下面是我18分的算法，由于最后一个测试点太大，直接加法明显不可以：

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int main(){
	string a,b;
	int sum;
	cin >> a;
	int cnt = 0;
	while(cnt<10){
		b = a;
		reverse(b.begin(),b.end());
		long long u,v,sum;
		u = stoll(a);
		v = stoll(b);
		if(b == a){
			cout << a << " is a palindromic number." << endl;
			return 0;
		}else{
			sum = u+v;
			printf("%lld + %lld = %lld\n",u,v,sum);
			a = to_string(sum);
			cnt++;
		}
	}
	cout << "Not found in 10 iterations." << endl;
}