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.

你看那个代码它又臭又长~ 

#include "pch.h"
#include <iostream>
#include<string.h>
#include<stdio.h>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<map>
#include<math.h>
using namespace std;
bool panduan(char *d)
{

	int len = strlen(d),i=0,j=len-1;
	while (i <= j)
	{
		if (d[i] != d[j])
			return false;
		i++;
		j--;
	}
	return true;
}


int main()
{
	char *a = new char[1002];
	cin >> a;
	if (panduan(a))
		cout << a << " is a palindromic number." << endl;
	else
	{
		int t = 0;
		string b = "";
		b += a;
		while (t < 10)
		{
			string c = b;
			reverse(b.begin(), b.end());
			int i = c.length() - 1, index = 0, cnt = 0;
			while (i >= 0)
			{
				int sum = c[i] - '0' + b[i] - '0' + index;
				if (sum >= 10)
				{
					index = 1;
					sum -= 10;
				}
				else
					index = 0;
				a[cnt++] = sum + '0';
				i--;
			}

			if (index == 1)
				a[cnt++] = '1';
			a[cnt++] = '\0';
			cout << c << " + " << b << " = ";
			b = "";
			b += a;
			reverse(b.begin(), b.end());
			cout << b << endl;
			if (panduan(a))
			{
				cout << a << " is a palindromic number." << endl;
				break;
			}
			else
				t++;
		}
		if (t == 10)
			cout << "Not found in 10 iterations." << endl;
	}
}