大数相除法

#include <string.h> #include <assert.h> void TrimZero(char *input) { int beginIndex = 0; int inputLen = 0; int outputIndex = 0; if(1 == strlen(input) && '0' == input[0]) { return; } inputLen = strlen(input); for(beginIndex = 0;beginIndex < inputLen; beginIndex++) { if('0' != input[beginIndex]) { break; } } for(;beginIndex < inputLen;) { input[outputIndex++] = input[beginIndex++]; } input[outputIndex] = 0; } void Multiply(const char *multiplier, const int faciend, char *result) { char tmpRes[100] = {0}; int multiIndex = 0; int resultIndex = 0; int multiLen = 0; int resultLen = 0; int exchNum = 0; int tempNum = 0; int modNum = 0;//模数 multiLen = strlen(multiplier); for(multiIndex = multiLen - 1; multiIndex >= 0 ;multiIndex--) { tempNum = (multiplier[multiIndex] - '0') * faciend + modNum; tmpRes[multiIndex] = tempNum % 10 + '0'; modNum = tempNum / 10; } if(0 != modNum) { result[0] = modNum + '0'; strcpy(result + 1, tmpRes); } else { strcpy(result, tmpRes); } } void Add(const char *augend, const char *addend, char *result) { char tmpRes[100] = {0}; int resultIndex = 0; int augIndex = 0; int addIndex = 0; int resLen = 0; int augLen = 0; int addLen = 0; int origNum = 0; int carryNum = 0; int tempNum = 0; augLen = strlen(augend); addLen = strlen(addend); resLen = augLen > addLen ? augLen : addLen; augIndex = augLen - 1; addIndex = addLen - 1; for(resultIndex = resLen - 1; resultIndex >= 0; resultIndex--) { origNum += carryNum; if(augIndex >= 0) { origNum += augend[augIndex] - '0'; augIndex--; } if(addIndex >= 0) { origNum += addend[addIndex] - '0'; addIndex--; } tmpRes[resultIndex] = '0' + origNum % 10; carryNum = origNum / 10; origNum = 0; } if(0 != carryNum) { result[0] = carryNum + '0'; strcpy(result + 1, tmpRes); } else { strcpy(result, tmpRes); } } void Sub(const char *minuend, const char *subtrahend, char *result) { char tmpRes[100] = {0}; int resultIndex = 0; int minuIndex = 0; int subtrIndex = 0; int resLen = 0; int minuLen = 0; int subtrLen = 0; int origNum = 0; int subNum = 0; int borrowNum = 0; int tempNum = 0; minuLen = strlen(minuend); subtrLen = strlen(subtrahend); resLen = minuLen; minuIndex = minuLen - 1; subtrIndex = subtrLen - 1; for(resultIndex = resLen - 1; resultIndex >= 0; resultIndex--) { origNum = (minuend[resultIndex] - '0')- borrowNum; if(subtrIndex >= 0) { subNum = subtrahend[subtrIndex] - '0'; subtrIndex--; } else { subNum = 0; } if(origNum < subNum) { borrowNum = 1; tmpRes[resultIndex] = '0' + ((10 + origNum) - subNum); } else { borrowNum = 0; tmpRes[resultIndex] = '0' + (origNum - subNum); } } for(resultIndex = 0;resultIndex < resLen; resultIndex++) { if('0' != tmpRes[resultIndex]) { break; } } if(resultIndex == resLen) { strcpy(result , "0"); } else { strcpy(result , tmpRes + resultIndex); } } int Comparare(const char *srcNum, const char *destNum) { int srcIndex = 0; int destIndex = 0; int srcLen = 0; int destLen = 0; int comparIndex = 0; srcLen = strlen(srcNum); destLen = strlen(destNum); if(srcLen > destLen) { return 1; } else { if(srcLen < destLen) { return -1; } } comparIndex = srcLen; for(comparIndex = 0;comparIndex < srcLen; comparIndex++ ) { if(srcNum[comparIndex] > destNum[comparIndex]) { return 1; } else { if(srcNum[comparIndex] < destNum[comparIndex]) { return -1; } } } return 0; } int BigDivision(const char *dividend, const char *divisor, char *result) { char comparator[10][100] = {0}; char original[100] = {0}; char residual[100] = {0}; int comparIndex = 0; int comparRes = 0; int resultIndex = 0; int dividendLen = 0; int divisorLen = 0; int dividendIndex = 0; int divisorIndex = 0; int facIndex = 0; comparator[0][0] = '0'; for(facIndex = 1; facIndex <= 9; facIndex++) { Multiply(divisor, facIndex, comparator[facIndex]); } dividendLen = strlen(dividend); divisorLen = strlen(divisor); strncpy(residual, dividend, divisorLen - 1); residual[divisorLen - 1] = 0; for(dividendIndex = divisorLen - 1;dividendIndex < dividendLen; dividendIndex++) { memset(original, 0, sizeof(original)); //余数补新位 if(!(1 == strlen(residual) && '0' == residual[0])) { strcpy(original, residual); } original[strlen(original)] = dividend[dividendIndex]; for(comparIndex = 0; comparIndex < 10; comparIndex++) { comparRes = Comparare(original, comparator[comparIndex]); if(comparRes <= 0) { break; } } if(comparRes < 0) { result[resultIndex++] = (comparIndex - 1)+ '0'; //取得余数 Sub(original, comparator[comparIndex - 1], residual); } else { if(0 == comparRes) { result[resultIndex++] = comparIndex + '0'; //取得余数 Sub(original, comparator[comparIndex], residual); original[0] = '0'; original[1] = 0; } if(comparRes > 0) { result[resultIndex++] = '9'; //取得余数 Sub(original, comparator[9], residual); } } } TrimZero(result); return 0; } int main(int argc, char *argv[]) { char dividend[100] = "9998887776665554443332211"; char divisor[100] = "9876543210000"; char resultStr[100] = {0}; while(1) { memset(dividend, 0, sizeof(dividend)); memset(divisor, 0, sizeof(divisor)); memset(resultStr, 0, sizeof(resultStr)); printf("Please input dividend number:/n"); scanf("%s", dividend); printf("Please input divisor number:/n"); scanf("%s", divisor); BigDivision(dividend, divisor, resultStr); printf("[%s] divide [%s],result is[%s]/n", dividend, divisor, resultStr); getchar(); getchar(); } return 0; }

可能的改进

把输入整形字符串转换为Int数组，整形数组中的每个Int元素使用低两个字节存储有效数值（整数数组中两个Int原酸相乘时，不会发生溢出），仍然采取上面代码的框架，稍微改动，再增加两个函数一个是把字符串形式表示的整数转换为Int数组形式表示的整数，另外一个函数把Int数组形式的整数转换为字符串形式表示的整数，其中后一个函数实现较为麻烦。

函数形式：

void _tTrimZero(const int *inputArr, const int inputLen, int *resultArr, int *resultLen) void _tMultiply(const int *multiplierArr, const int multiplierLen, const int faciend, int *result, int resultLen) void _tAdd(const int *augendArr, const int augendLen, const int *addendArr, const int addendLen, int *resultArr, int *resultLen) void _tSub(const int *minuendArr, const int minuendLen, const int *subtrahendArr, const int subtrahendLen, int *resultArr, int *resultLen) int _tComparare(const int *srcArr, const int srcLen, const int *destArr, const int destLen) void _tIntArr2Str(const int *intArr, const int intLen, char *strArr) void _tStr2IntArr(const char *intStr, int *intArr, int *intLen)