3
3
//! For most of the problems, It is sufficient to use [`ModInt1000000007`] or [`ModInt998244353`], which can be used as follows.
4
4
//!
5
5
//! ```
6
- //! use ac_library_rs ::ModInt1000000007 as Mint; // rename to whatever you want
6
+ //! use ac_library ::ModInt1000000007 as Mint; // rename to whatever you want
7
7
//! use proconio::{input, source::once::OnceSource};
8
8
//!
9
9
//! input! {
18
18
//! If the modulus is not fixed, you can use [`ModInt`] as follows.
19
19
//!
20
20
//! ```
21
- //! use ac_library_rs ::ModInt as Mint; // rename to whatever you want
21
+ //! use ac_library ::ModInt as Mint; // rename to whatever you want
22
22
//! use proconio::{input, source::once::OnceSource};
23
23
//!
24
24
//! input! {
@@ -73,7 +73,7 @@ pub type ModInt = DynamicModInt<DefaultId>;
73
73
/// # Example
74
74
///
75
75
/// ```
76
- /// use ac_library_rs ::ModInt1000000007 as Mint;
76
+ /// use ac_library ::ModInt1000000007 as Mint;
77
77
/// use proconio::{input, source::once::OnceSource};
78
78
///
79
79
/// input! {
@@ -99,7 +99,7 @@ impl<M: Modulus> StaticModInt<M> {
99
99
/// # Example
100
100
///
101
101
/// ```
102
- /// use ac_library_rs ::ModInt1000000007 as Mint;
102
+ /// use ac_library ::ModInt1000000007 as Mint;
103
103
///
104
104
/// assert_eq!(1_000_000_007, Mint::modulus());
105
105
/// ```
@@ -217,13 +217,13 @@ impl<M: Modulus> ModIntBase for StaticModInt<M> {
217
217
/// #[derive(Copy, Clone, Eq, PartialEq)]
218
218
/// enum $name {}
219
219
///
220
- /// impl ac_library_rs ::modint::Modulus for $name {
220
+ /// impl ac_library ::modint::Modulus for $name {
221
221
/// const VALUE: u32 = $value;
222
222
/// const HINT_VALUE_IS_PRIME: bool = $is_prime;
223
223
///
224
- /// fn butterfly_cache() -> &'static ::std::thread::LocalKey<::std::cell::RefCell<::std::option::Option<ac_library_rs ::modint::ButterflyCache<Self>>>> {
224
+ /// fn butterfly_cache() -> &'static ::std::thread::LocalKey<::std::cell::RefCell<::std::option::Option<ac_library ::modint::ButterflyCache<Self>>>> {
225
225
/// thread_local! {
226
- /// static BUTTERFLY_CACHE: ::std::cell::RefCell<::std::option::Option<ac_library_rs ::modint::ButterflyCache<$name>>> = ::std::default::Default::default();
226
+ /// static BUTTERFLY_CACHE: ::std::cell::RefCell<::std::option::Option<ac_library ::modint::ButterflyCache<$name>>> = ::std::default::Default::default();
227
227
/// }
228
228
/// &BUTTERFLY_CACHE
229
229
/// }
@@ -232,7 +232,7 @@ impl<M: Modulus> ModIntBase for StaticModInt<M> {
232
232
/// };
233
233
/// }
234
234
///
235
- /// use ac_library_rs ::StaticModInt;
235
+ /// use ac_library ::StaticModInt;
236
236
///
237
237
/// modulus!(Mod101(101, true), Mod103(103, true));
238
238
///
@@ -294,7 +294,7 @@ pub struct ButterflyCache<M> {
294
294
/// # Example
295
295
///
296
296
/// ```
297
- /// use ac_library_rs ::ModInt as Mint;
297
+ /// use ac_library ::ModInt as Mint;
298
298
/// use proconio::{input, source::once::OnceSource};
299
299
///
300
300
/// input! {
@@ -325,7 +325,7 @@ impl<I: Id> DynamicModInt<I> {
325
325
/// # Example
326
326
///
327
327
/// ```
328
- /// use ac_library_rs ::ModInt as Mint;
328
+ /// use ac_library ::ModInt as Mint;
329
329
///
330
330
/// assert_eq!(998_244_353, Mint::modulus()); // default modulus
331
331
/// ```
@@ -345,7 +345,7 @@ impl<I: Id> DynamicModInt<I> {
345
345
/// # Example
346
346
///
347
347
/// ```
348
- /// use ac_library_rs ::ModInt as Mint;
348
+ /// use ac_library ::ModInt as Mint;
349
349
///
350
350
/// Mint::set_modulus(7);
351
351
/// assert_eq!(7, Mint::modulus());
@@ -547,7 +547,7 @@ pub trait ModIntBase:
547
547
/// # Example
548
548
///
549
549
/// ```
550
- /// use ac_library_rs ::modint::ModIntBase;
550
+ /// use ac_library ::modint::ModIntBase;
551
551
///
552
552
/// fn f<Z: ModIntBase>() {
553
553
/// let _: u32 = Z::modulus();
@@ -567,7 +567,7 @@ pub trait ModIntBase:
567
567
/// If `val` is greater than or equal to `Self::modulus()`, the behaviors are not defined.
568
568
///
569
569
/// ```should_panic
570
- /// use ac_library_rs ::ModInt1000000007 as Mint;
570
+ /// use ac_library ::ModInt1000000007 as Mint;
571
571
///
572
572
/// let x = Mint::raw(1_000_000_007);
573
573
/// let y = x + x;
@@ -584,7 +584,7 @@ pub trait ModIntBase:
584
584
/// # Example
585
585
///
586
586
/// ```
587
- /// use ac_library_rs ::modint::ModIntBase;
587
+ /// use ac_library ::modint::ModIntBase;
588
588
///
589
589
/// fn f<Z: ModIntBase>() -> Z {
590
590
/// debug_assert!(Z::modulus() >= 100);
@@ -608,7 +608,7 @@ pub trait ModIntBase:
608
608
/// # Example
609
609
///
610
610
/// ```
611
- /// use ac_library_rs ::modint::ModIntBase;
611
+ /// use ac_library ::modint::ModIntBase;
612
612
///
613
613
/// fn f<Z: ModIntBase>(x: Z) {
614
614
/// let _: u32 = x.val();
@@ -627,7 +627,7 @@ pub trait ModIntBase:
627
627
/// # Example
628
628
///
629
629
/// ```
630
- /// use ac_library_rs ::modint::ModIntBase;
630
+ /// use ac_library ::modint::ModIntBase;
631
631
///
632
632
/// fn f<Z: ModIntBase>(x: Z) {
633
633
/// let _: Z = x.inv();
@@ -642,7 +642,7 @@ pub trait ModIntBase:
642
642
/// # Example
643
643
///
644
644
/// ```
645
- /// use ac_library_rs ::modint::ModIntBase;
645
+ /// use ac_library ::modint::ModIntBase;
646
646
///
647
647
/// fn f<Z: ModIntBase>() {
648
648
/// let _ = Z::new(1u32);
@@ -664,7 +664,7 @@ pub trait ModIntBase:
664
664
/// # Example
665
665
///
666
666
/// ```
667
- /// use ac_library_rs ::modint::ModIntBase;
667
+ /// use ac_library ::modint::ModIntBase;
668
668
///
669
669
/// fn f<Z: ModIntBase>() {
670
670
/// let _: Z = Z::new(2).pow(3);
0 commit comments