1024 Palindromic Number (25分)

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

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. For example, if we start from 67, we can obtain a palindromic number in 2 steps: 67 + 76 = 143, and 143 + 341 = 484.

Given any positive integer N, you are supposed to find its paired palindromic number and the number of steps taken to find it.
Input Specification:

Each input file contains one test case. Each case consists of two positive numbers N and K, where N (≤10​10​​) is the initial numer and K (≤100) is the maximum number of steps. The numbers are separated by a space.
Output Specification:

For each test case, output two numbers, one in each line. The first number is the paired palindromic number of N, and the second number is the number of steps taken to find the palindromic number. If the palindromic number is not found after K steps, just output the number obtained at the Kth step and K instead.
Sample Input 1:

67 3

Sample Output 1:

484
2

Sample Input 2:

69 3

Sample Output 2:

1353
3

题意：判断一个数是不是回文数字，如果不是就把它逆序然后相加在判断是不是回文数字，一直往复，直到他是回文数字为止或达到次数
注意点：如果一个数字轮回往复20多次，他就超出了longlong的范围，所以在这里我们要用大整数运算存储；

AC代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct bign{//大整数的定义
	int d[1000];
	int len;
	bign(){
		memset(d,0,sizeof(d));
		len=0;
	}
};
bool judge(bign a){//判断一个数字是不是回文数字
	for(int i=0;i<=a.len/2;i++){//注意这里的等于
		if(a.d[i]!=a.d[a.len-1-i]){
			return false;
		}
	}
	return true;
}
bign to_bign(char str[]){//将str数组数组转换到bign中，注意位置的存放，在中
//低位对低位，而str中低位在最高位中
	bign a;//
	a.len=strlen(str);
	for(int i=0;i<a.len;i++){
		a.d[i]=str[a.len-i-1]-'0';
	}
	return a;
}
bign add(bign a,bign b){
	bign c;
	int carry=0;//表示进位
	for(int i=0;i<a.len||i<b.len;i++){
		int temp=a.d[i]+b.d[i]+carry;
	    carry=temp/10;
	    c.d[c.len++]=temp%10;
		
	}
	if(carry!=0){//如果最后进位不为0，说明超出了，需要多加一位
		c.d[c.len++]=carry;
	}
	return c;
}
void print(bign a){
	for(int i=a.len-1;i>=0;i--){//高位输出
		printf("%d",a.d[i]);
	}
	printf("\n");

}
int main(){
	int count=0,t;
	char str[1000];
	scanf("%s %d",str,&t);
	bign a=to_bign(str);
	while(count<t&&judge(a)==false){
        bign b=a;
        reverse(b.d,b.d+b.len);
        a=add(a,b);
        count++;
    }
    print(a);
    printf("%d\n",count);
    return 0;
}