PAT 갑 1136 A Delayed Palindrome (20 점)

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

char A[1100],B[1100],C[1100],D[1100];

void reverse(char A[],char B[])
{
    int len=strlen(A);
    for(int i=0;i1];
    }
    B[len]='\0';
}

void ADD(char A[],char B[],char C[])
{
    int carry=0;
    int len=0;
    for(int i=0;i<strlen(A);i++)
    {
        int pop=(A[i]+B[i]+carry-'0'-'0')%10;
        carry=(A[i]+B[i]-'0'-'0'+carry)/10;
        C[len++]=pop+'0';
    }
    if(carry!=0)C[len++]=carry+'0';
    C[len++]='\0';
}

bool judge(char A[])
{
    bool flag=true;
    int len=strlen(A);
    for(int i=0;i2;i++)
    {
        if(A[i]!=A[len-i-1])
        {
            flag=false;
            break;
        }
    }
    return flag;
}

int main()
{
    scanf("%s",&A);
    int step=0;
    while(!judge(A))
    {
        reverse(A,B);
        ADD(A,B,C);
        reverse(C,D);
        printf("%s + %s = %s
",A,B,D);
        strcpy(A,D);
        step++;
        if(step==10)
        {
            printf("Not found in 10 iterations.
");
            break;
        }
    }
    if(judge(A))
    {
        printf("%s is a palindromic number.",A);
    }
    return 0;
}