@@ -673,7 +673,7 @@ pub trait ModIntBase:
673
673
#[ inline]
674
674
fn pow ( self , mut n : u64 ) -> Self {
675
675
let mut x = self ;
676
- let mut r = Self :: raw ( 1 ) ;
676
+ let mut r = Self :: raw ( u32 :: from ( Self :: modulus ( ) > 1 ) ) ;
677
677
while n > 0 {
678
678
if n & 1 == 1 {
679
679
r *= x;
@@ -1043,13 +1043,14 @@ macro_rules! impl_folding {
1043
1043
1044
1044
impl_folding ! {
1045
1045
impl <M : Modulus > Sum <_> for StaticModInt <M > { fn sum( _) -> _ { _( Self :: raw( 0 ) , Add :: add) } }
1046
- impl <M : Modulus > Product <_> for StaticModInt <M > { fn product( _) -> _ { _( Self :: raw( 1 ) , Mul :: mul) } }
1046
+ impl <M : Modulus > Product <_> for StaticModInt <M > { fn product( _) -> _ { _( Self :: raw( u32 :: from ( Self :: modulus ( ) > 1 ) ) , Mul :: mul) } }
1047
1047
impl <I : Id > Sum <_> for DynamicModInt <I > { fn sum( _) -> _ { _( Self :: raw( 0 ) , Add :: add) } }
1048
- impl <I : Id > Product <_> for DynamicModInt <I > { fn product( _) -> _ { _( Self :: raw( 1 ) , Mul :: mul) } }
1048
+ impl <I : Id > Product <_> for DynamicModInt <I > { fn product( _) -> _ { _( Self :: raw( u32 :: from ( Self :: modulus ( ) > 1 ) ) , Mul :: mul) } }
1049
1049
}
1050
1050
1051
1051
#[ cfg( test) ]
1052
1052
mod tests {
1053
+ use crate :: modint:: ModInt ;
1053
1054
use crate :: modint:: ModInt1000000007 ;
1054
1055
1055
1056
#[ test]
@@ -1157,4 +1158,17 @@ mod tests {
1157
1158
c /= b;
1158
1159
assert_eq ! ( expected, c) ;
1159
1160
}
1161
+
1162
+ // Corner cases of "modint" when mod = 1
1163
+ // https://github.com/rust-lang-ja/ac-library-rs/issues/110
1164
+ #[ test]
1165
+ fn mod1_corner_case ( ) {
1166
+ ModInt :: set_modulus ( 1 ) ; // !!
1167
+
1168
+ let x: ModInt = std:: iter:: empty :: < ModInt > ( ) . product ( ) ;
1169
+ assert_eq ! ( x. val( ) , 0 ) ;
1170
+
1171
+ let y = ModInt :: new ( 123 ) . pow ( 0 ) ;
1172
+ assert_eq ! ( y. val( ) , 0 ) ;
1173
+ }
1160
1174
}
0 commit comments