c语言高精度除法余数

#include <stdio.h>
#include <stdlib.h>

// 计算高精度除法余数
int* divide(int* dividend, int dividendSize, int* divisor, int divisorSize, int* remainder) {
    // 初始化
    int* quotient = (int*)malloc(sizeof(int) * (dividendSize - divisorSize + 1));
    int* remainder = (int*)malloc(sizeof(int) * divisorSize);
    int i, j, k;

    // 将被除数和除数转换为整数数组
    int dividendArray[dividendSize], divisorArray[divisorSize];
    for (i = 0; i < dividendSize; i++) dividendArray[i] = dividend[dividendSize - 1 - i];
    for (i = 0; i < divisorSize; i++) divisorArray[i] = divisor[divisorSize - 1 - i];

    // 循环计算
    for (i = dividendSize - divisorSize; i >= 0; i--) {
        // 计算商
        int quotient = 0;
        for (j = 0; j < divisorSize; j++) {
            quotient += (dividendArray[i + j] / divisorArray[0]) << (j * 32);
        }

        // 更新被除数
        for (j = 0; j < divisorSize; j++) {
            dividendArray[i + j] -= quotient * divisorArray[j];
        }

        // 记录商
        quotientArray[i] = quotient;
    }

    // 复制余数
    for (i = 0; i < divisorSize; i++) {
        remainder[i] = dividendArray[i];
    }

    // 返回结果
    return remainder;
}

int main() {
    // 输入被除数和除数
    int dividend[] = {1, 2, 3, 4, 5, 6};
    int divisor[] = {7, 8, 9};
    int dividendSize = sizeof(dividend) / sizeof(int);
    int divisorSize = sizeof(divisor) / sizeof(int);

    // 计算余数
    int* remainder = divide(dividend, dividendSize, divisor, divisorSize, NULL);

    // 输出余数
    for (i = divisorSize - 1; i >= 0; i--) {
        printf("%d", remainder[i]);
    }

    // 释放内存
    free(remainder);

    return 0;
}