微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

大数阶乘(结果)

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

#define MaxSize 1000000

char *BigNumFactorial(int InputOrderMultiplier)
{
    int *TempResult = malloc(MaxSize*sizeof(int));
    int TempResultEnd;
    memset(TempResult,0,MaxSize*sizeof(int));
    TempResult[0] = 1;
    
    char *Result = malloc(MaxSize*sizeof(char));
    memset(Result,MaxSize*sizeof(char));
    int ResultEnd = 0;
    
    int Carry = 0,Digit = 1;
    int TripNum,TripDigit;
    int Temp;
    
    for(TripNum = 2;TripNum <= InputOrderMultiplier;TripNum ++)
    {
        Carry = 0;
        for(TripDigit = 0;TripDigit < Digit;TripDigit ++)
        {
            //multiply every TR‘s TD by TN
            Temp = TempResult[TripDigit]*TripNum + Carry;
            TempResult[TripDigit] = Temp % 10;
            Carry = Temp / 10;
        }
        while(Carry)
        {
            TempResult[Digit++] = Carry % 10;
            Carry /= 10;
        }
    }
    
    for(TempResultEnd = Digit-1;TempResultEnd >= 0;TempResultEnd --)
    {
        Result[ResultEnd++] = TempResult[TempResultEnd] + 0;
    }
    Result[ResultEnd] = \0;
    return Result;
}

int main()
{
    int InputOrderMultiplier = 19999;
    char *Result = BigNumFactorial(InputOrderMultiplier);
    puts(Result);
    return 0;
}

版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。

相关推荐