NYOJ28--大数阶乘
大数阶乘
时间限制:
3000 ms ?|? 内存限制:
65535 KB
难度:
3
代码: #include <stdio.h> #include <string.h> int a[100000]; int main() { ??? int m,carry,temp,digit,i,j; ??? while((scanf("%d",&m)) != EOF) ??? { ??????? memset(a,sizeof(a)); ??????? a[0] = 1; ??????? carry = 0;//余数初始化为0 ??????? digit = 1;//位数初始化为1 ??????? for(i = 2; i <= m; i++) ??????? { ??????????? for(j = 1; j <= digit; ++j) ??????????? { ??????????????? temp = a[j-1]*i + carry; ??????????????? a[j-1] = temp % 10; ??????????????? carry = temp/10; ??????????? } ??????????? while(carry)//如果有进位 ??????????? { ?????????????? a[++digit-1] = carry % 10; ?????????????? carry /= 10; ??????????? } ??????? } ??????? for(i = digit; i >= 1; --i) ??????? { ??????????? printf("%d",a[i-1]); ??????? } ??????? printf("n"); ??? } ??? return 0; } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |