110502 Reverse and Add

#include <string>
#include <vector>
#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

static bool IsReverse(const char* num, int len)
{
	int mid = len / 2;
	for (int i = 0; i < mid; ++i)
	{
		if (num[i] != num[len - 1 - i])
			return false;
	}

	return true;
}

static int Add(char ch1, char ch2, int& flag)
{
	int sum = (ch1 - '0') + (ch2 - '0') + flag;
	flag = sum / 10;
	return sum % 10;
}

static void GetNewNumber(const char* originalNum, int& len, char*& newNumber)
{
	vector<int> sum;
	int bitSum, flag = 0;
	
	for (int i = len - 1; i >= 0; --i)
	{
		bitSum = Add(originalNum[i], originalNum[len - 1 - i], flag);
		sum.push_back(bitSum);
	}

	if (flag > 0)
		sum.push_back(flag);

	int cnt = sum.size();
	newNumber = new char[cnt + 1];
	for (int i = cnt - 1; i >= 0; --i)
		newNumber[cnt - 1 - i] = sum[i] + '0'; 
	newNumber[cnt] = '\0';
	len = cnt;
}

static void ReverseAndAdd(const char* num, int len)
{
	int sum = 0;

	if (IsReverse(num, len))
	{
		cout << sum << ' ' << num << endl;
		return;
	}

	char *newNumber, *tmp;
	GetNewNumber(num, len, newNumber);
	++sum;
	while(!IsReverse(newNumber, len))
	{
		++sum;
		tmp = newNumber;
		GetNewNumber(tmp, len, newNumber);
		delete[] tmp;
	}

	cout << sum << ' ' << newNumber << endl;
	delete[] newNumber;
}

#define BUF_SIZE 1024
static void Test()
{
	int cnt;
	char buf[BUF_SIZE];
	cin >> cnt;
	for (int i = 0; i < cnt; ++i)
	{
		cin >> buf;
		ReverseAndAdd(buf, strlen(buf));
	}
}

int main(int argc, char* argv[])
{
	Test();
	return 0;
}