[英]How do I calculate a multiple factorial using num_bigint in Rust?
[英]How to calculate 21 factorial in Rust?
我需要在我的项目中计算 21 个阶乘。
fn factorial(num: u64) -> u64 {
match num {
0 => 1,
1 => 1,
_ => factorial(num - 1) * num,
}
}
fn main() {
let x = factorial(21);
println!("The value of 21 factorial is {} ", x);
}
运行此代码时,出现错误:
thread 'main' panicked at 'attempt to multiply with overflow', src\main.rs:5:18
一个u64
21! (它在 2^65 和 2^66 之间),但是u128
可以。
一个可能的实现可能是
pub fn factorial(num: u128) -> u128 {
match num {
0 => 1,
1.. => (1..num+1).product(),
}
}
#[test]
fn factorial_of_21() {
assert_eq!(51090942171709440000,factorial(21));
}
我认为实现应该是这样的
pub fn factorial(num: u128) -> u128 {
(1..=num).product()
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.