#696904 (Rust) No.1659 Product of Divisors

• 問題: No.1659 Product of Divisors
• ユーザー: ziita
• 提出日時: 2021-09-06 21:54:03
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 107 ms / 2,000 ms
• コード長: 10,650 bytes
• コンパイル時間: 11,849 ms
• コンパイル使用メモリ: 404,968 KB
• 実行使用メモリ: 34,432 KB
• 最終ジャッジ日時: 2024-06-02 03:28:55
• 合計ジャッジ時間: 15,510 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	94 ms; 34,304 KB
testcase_01	AC	98 ms; 34,276 KB
testcase_02	AC	101 ms; 34,300 KB
testcase_03	AC	105 ms; 34,404 KB
testcase_04	AC	107 ms; 34,304 KB
testcase_05	AC	104 ms; 34,396 KB
testcase_06	AC	104 ms; 34,304 KB
testcase_07	AC	105 ms; 34,432 KB
testcase_08	AC	97 ms; 34,432 KB
testcase_09	AC	100 ms; 34,304 KB
testcase_10	AC	102 ms; 34,388 KB
testcase_11	AC	96 ms; 34,280 KB
testcase_12	AC	97 ms; 34,432 KB
testcase_13	AC	103 ms; 34,324 KB
testcase_14	AC	102 ms; 34,432 KB
testcase_15	AC	101 ms; 34,424 KB
testcase_16	AC	94 ms; 34,304 KB
testcase_17	AC	102 ms; 34,432 KB
testcase_18	AC	99 ms; 34,432 KB
testcase_19	AC	104 ms; 34,304 KB
testcase_20	AC	96 ms; 34,432 KB
testcase_21	AC	105 ms; 34,296 KB
testcase_22	AC	101 ms; 34,320 KB
testcase_23	AC	101 ms; 34,296 KB
testcase_24	AC	101 ms; 34,396 KB

ソースコード

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;
use std::marker::*;

// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
// https://yukicoder.me/submissions/585145 より
// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 1_000_000_007;
    }

    #[allow(dead_code)]
    pub struct StaticMod;
    static mut STATIC_MOD: u32 = 0;
    impl Modulo for StaticMod {
        fn modulo() -> u32 {
            unsafe { STATIC_MOD }
        }
    }

    #[allow(dead_code)]
    impl StaticMod {
        pub fn set_modulo(p: u32) {
            unsafe {
                STATIC_MOD = p;
            }
        }
    }

    use std::marker::*;
    use std::ops::*;

    pub trait Modulo {
        fn modulo() -> u32;
    }

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

    pub struct ModInt<T>(pub u32, PhantomData<T>);

    impl<T> Clone for ModInt<T> {
        fn clone(&self) -> Self {
            ModInt::new_unchecked(self.0)
        }
    }

    impl<T> Copy for ModInt<T> {}

    impl<T: Modulo> Add for ModInt<T> {
        type Output = ModInt<T>;
        fn add(self, rhs: Self) -> Self::Output {
            let mut d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> AddAssign for ModInt<T> {
        fn add_assign(&mut self, rhs: Self) {
            *self = *self + rhs;
        }
    }

    impl<T: Modulo> Sub for ModInt<T> {
        type Output = ModInt<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            let mut d = T::modulo() + self.0 - rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> SubAssign for ModInt<T> {
        fn sub_assign(&mut self, rhs: Self) {
            *self = *self - rhs;
        }
    }

    impl<T: Modulo> Mul for ModInt<T> {
        type Output = ModInt<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
            ModInt::new_unchecked(v as u32)
        }
    }

    impl<T: Modulo> MulAssign for ModInt<T> {
        fn mul_assign(&mut self, rhs: Self) {
            *self = *self * rhs;
        }
    }

    impl<T: Modulo> Neg for ModInt<T> {
        type Output = ModInt<T>;
        fn neg(self) -> Self::Output {
            if self.0 == 0 {
                Self::zero()
            } else {
                Self::new_unchecked(T::modulo() - self.0)
            }
        }
    }

    impl<T> std::fmt::Display for ModInt<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T: Modulo> std::str::FromStr for ModInt<T> {
        type Err = std::num::ParseIntError;
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            let val = s.parse::<u32>()?;
            Ok(ModInt::new(val))
        }
    }

    impl<T: Modulo> From<usize> for ModInt<T> {
        fn from(val: usize) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as usize) as u32)
        }
    }

    impl<T: Modulo> From<u64> for ModInt<T> {
        fn from(val: u64) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as u64) as u32)
        }
    }

    impl<T: Modulo> From<i64> for ModInt<T> {
        fn from(val: i64) -> ModInt<T> {
            let m = T::modulo() as i64;
            ModInt::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModInt<T> {
        pub fn new_unchecked(d: u32) -> Self {
            ModInt(d, PhantomData)
        }
        pub fn zero() -> Self {
            ModInt::new_unchecked(0)
        }
        pub fn one() -> Self {
            ModInt::new_unchecked(1)
        }
        pub fn is_zero(&self) -> bool {
            self.0 == 0
        }
    }

    #[allow(dead_code)]
    impl<T: Modulo> ModInt<T> {
        pub fn new(d: u32) -> Self {
            ModInt::new_unchecked(d % T::modulo())
        }
        pub fn pow(&self, mut n: u64) -> Self {
            let mut t = Self::one();
            let mut s = *self;
            while n > 0 {
                if n & 1 == 1 {
                    t *= s;
                }
                s *= s;
                n >>= 1;
            }
            t
        }
        pub fn inv(&self) -> Self {
            assert!(self.0 != 0);
            self.pow(T::modulo() as u64 - 2)
        }
    }

    #[allow(dead_code)]
    pub fn mod_pow(r: u64, mut n: u64, m: u64) -> u64 {
        let mut t = 1 % m;
        let mut s = r % m;
        while n > 0 {
            if n & 1 == 1 {
                t = t * s % m;
            }
            s = s * s % m;
            n >>= 1;
        }
        t
    }
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
mod precalc {
    use super::modint::*;
    #[allow(dead_code)]
    pub struct Precalc<T> {
        inv: Vec<ModInt<T>>,
        fact: Vec<ModInt<T>>,
        ifact: Vec<ModInt<T>>,
    }
    #[allow(dead_code)]
    impl<T: Modulo> Precalc<T> {
        pub fn new(n: usize) -> Precalc<T> {
            let mut inv = vec![ModInt::one(); n + 1];
            let mut fact = vec![ModInt::one(); n + 1];
            let mut ifact = vec![ModInt::one(); n + 1];
            for i in 2..(n + 1) {
                fact[i] = fact[i - 1] * ModInt::new_unchecked(i as u32);
            }
            ifact[n] = fact[n].inv();
            if n > 0 {
                inv[n] = ifact[n] * fact[n - 1];
            }
            for i in (1..n).rev() {
                ifact[i] = ifact[i + 1] * ModInt::new_unchecked((i + 1) as u32);
                inv[i] = ifact[i] * fact[i - 1];
            }
            Precalc {
                inv: inv,
                fact: fact,
                ifact: ifact,
            }
        }
        pub fn inv(&self, n: usize) -> ModInt<T> {
            assert!(n > 0);
            self.inv[n]
        }
        pub fn fact(&self, n: usize) -> ModInt<T> {
            self.fact[n]
        }
        pub fn ifact(&self, n: usize) -> ModInt<T> {
            self.ifact[n]
        }
        pub fn perm(&self, n: usize, k: usize) -> ModInt<T> {
            if k > n {
                return ModInt::zero();
            }
            self.fact[n] * self.ifact[n - k]
        }
        pub fn comb(&self, n: usize, k: usize) -> ModInt<T> {
            if k > n {
                return ModInt::zero();
            }
            self.fact[n] * self.ifact[k] * self.ifact[n - k]
        }
    }
}
// ---------- end Precalc ----------

use modint::*;
type M = ModInt<Mod>;

struct SieveOfEratosthenes {
    primes: Vec<usize>,
    divs: Vec<usize>,
    mobius: Vec<i64>,
}

impl SieveOfEratosthenes {
    pub fn new(n: usize) -> Self {
        let mut divs = vec![1;n+1];
        let mut mobius = vec![-1;n+1];
        for i in 2..=n {
            if divs[i]!=1 {
                continue;
            }
            for j in 1..=n {
                let val = i*j;
                if val>n {
                    break;
                }
                divs[val as usize] = i;
                if (val/i)%i==0 {
                    mobius[val as usize] = 0;
                }
                else {
                    mobius[val as usize] = -mobius[val as usize];
                }
            }
        }
        let mut primes = divs.iter()
                             .enumerate()
                             .filter(|x| *x.1>1 && x.0==*x.1)
                             .map(|x| *x.1)
                             .collect::<Vec<usize>>();
        SieveOfEratosthenes {
            divs,
            primes,
            mobius,
        }
    }
    pub fn factors(&self, n: usize) -> Vec<(usize,usize)> {
        assert!(n+1<=self.divs.len());
        let mut ans = vec![];
        let mut x = n;
        while x > 1 {
            let nxt = self.divs[x];
            ans.push(nxt);
            x /= nxt;
        }
        let mut map = HashMap::<usize,usize>::new();
        for &a in &ans {
            *map.entry(a).or_insert(0) += 1;
        }
        let mut ret = vec![];
        for (&k,&v) in map.iter() {
            ret.push((k,v));
        }
        ret
    }
}

const MOD: i64 = 1_000_000_007;

fn main() {
    input! {
        n: i64,
        k: i64,
    }
    let p = SieveOfEratosthenes::new(2000000);
    let mut val = n;
    let mut map = HashMap::new();
    for &p in &p.primes {
        let x = p as i64;
        while val%x==0 {
            val /= x;
            *map.entry(x).or_insert(0) += 1;
        }
    }
    if val!=1 {
        *map.entry(val).or_insert(0) += 1;
    }
    let mut ans = M::new(1);
    for (_,&v) in map.iter() {
        let mut tmp = M::new(1);
        for i in 0..v {
            tmp *= M::from((k+v-i)%MOD);
            tmp *= M::from(i+1).inv();
        }
        ans *= tmp;
    }
    println!("{}",ans);
}