查看会员资料
用 户 名:刘***
发送消息- Email:用户隐藏
- Icq/MSN:
- 电话号码:
- Homepage:
- 会员简介:
最新会员发布资源
biadata
- 逐位相乘,再对齐相加,缺点很明显,如果n值比较大,运算次数将非常多,必定会超时,1万的阶乘想在1秒内完成肯定无法达成。-Multiplied by bit, and then align the added drawback Obviously, if the value of n is relatively large, the number of operations will be very much will definitely timeout, 10000 factorial wan