int change2array(int64_t m, int num[])
{
	int length = 0, temp, k;
	while(m != 0)
	{
		num[length] = m%10;
		m /= 10;
		length++;
	}

	for(k = 0;k < length/2;k++)
	{
		temp = num[k];
		num[k] = num[length-1-k];
		num[length-1-k] = temp;
	}
	return length;
}


int main(int argc, char **argv)
{
	int64_t m =  88200807199688;
	int64_t n = 345678912345678;
	int length1 = 0, length2 = 0, k, temp;
	int num1[MAXLINE] = {0}, num2[MAXLINE] = {0};

	length1 = change2array(m, num1);
	length2 = change2array(n, num2);
	
	for(k = 0;k < length1;k++)
		printf("%d",*(num1 + k));
	printf("\n");
	for(k = 0;k < length2;k++)
		printf("%d",num2[k]);
	
	exit(0);
}
//利用陣列可以實現高精度計算.(+ - *)