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.

编译器 (31)--C++ 

#include <iostream>
#include <stdio.h>
#include <cstring>

using namespace std;

char a[1001];
char c[1001];
int pan(char b[],int blen);
int cal(int n)
{
    int len=0;
    while(a[len]!='\0')len++;
    int flag;
    flag=pan(a,len);
    if(flag==1)
    {
        for(int i=0;i<len;i++)
        cout<<a[i];
        cout<<" is a palindromic number."<<endl;
    }
    else{
        char b[1001]={'0'};
        for(int i=0;i<len;i++)
        {
            int q;
            q=a[i]-'0'+c[i]-'0'+b[i]-'0';
            if(q>=10)
            {
                b[i]='0'+q-10;b[i+1]='1';
            }
            else
            {
                b[i]='0'+q;b[i+1]='0';
            }
        }
        cout<<c<<" + ";
        cout<<a<<" = ";
        int blen=0;
        if(b[len]>'0')blen=len+1;
        else blen=len;
        for(int i=blen-1;i>=0;i--)
            cout<<b[i];
        cout<<endl;
        for(int i=0;i<blen;i++)
        {
            a[i]=b[i];
            c[i]=b[blen-i-1];
        }
        a[blen]='\0';
    }
    if(flag==0&&n==10)
        cout<<"Not found in 10 iterations."<<endl;
    return flag;
}

int pan(char b[],int blen)
{
    for(int i=0;i<blen/2;i++)
    {
        if(b[i]!=b[blen-i-1])
        {
            return 0;
        }
    }
    return 1;
}

int main()
{
    scanf("%s",c);
    int flag=0;
    int len=0;
    while(c[len]!='\0')len++;
    for(int i=0;i<len;i++)
        a[i]=c[len-i-1];
    c[len]='\0';
    for(int i=0;i<10;i++)
    {
        flag=cal(i+1);
        if(flag==1)break;
    }

	return 0;
}