結果

問題 No.2752 文字列の数え上げ mod 998244353
コンテスト
ユーザー naut3
提出日時 2024-05-10 23:07:16
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 52 ms / 2,000 ms
コード長 4,826 bytes
コンパイル時間 12,773 ms
コンパイル使用メモリ 402,712 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-20 07:19:51
合計ジャッジ時間 14,878 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(non_snake_case, unused_imports)]
use proconio::{fastout, input, marker::*};

#[fastout]
fn main() {
    input! {
        T: usize,
        L: [usize; T],
    }

    for l in L {
        let a = (MInt998244353::from_raw(26) * MInt998244353::from_raw(26).pow(l as u64)
            - 1.into())
            / 25.into();

        println!("{}", a - 1.into());
    }
}

pub type MInt998244353 = ModInt<998244353>;
pub type MInt1000000007 = ModInt<1_000_000_007>;

#[derive(Clone, Copy, Eq, PartialEq, Debug)]
pub struct ModInt<const P: u32> {
    value: u32,
}

impl<const P: u32> ModInt<P> {
    pub fn value(&self) -> u32 {
        assert!(self.value < P);
        return self.value;
    }

    pub fn new() -> Self {
        return Self { value: 0 };
    }

    pub fn from_raw(x: u32) -> Self {
        return Self { value: x };
    }

    pub fn inv(&self) -> Self {
        pub fn ext_gcd(a: isize, b: isize) -> (isize, isize) {
            let mut a_k = a;
            let mut b_k = b;

            let mut q_k = a_k / b_k;
            let mut r_k = a_k % b_k;

            let mut x_k = 0;
            let mut y_k = 1;
            let mut z_k = 1;
            let mut w_k = -q_k;

            a_k = b_k;
            b_k = r_k;

            while r_k != 0 {
                q_k = a_k / b_k;
                r_k = a_k % b_k;

                a_k = b_k;
                b_k = r_k;

                let nx = z_k;
                let ny = w_k;
                let nz = x_k - q_k * z_k;
                let nw = y_k - q_k * w_k;

                x_k = nx;
                y_k = ny;
                z_k = nz;
                w_k = nw;
            }

            (x_k, y_k)
        }

        let val = self.value() as isize;

        let ret = ext_gcd(val, P as isize).0;

        return Self::from(ret);
    }

    pub fn pow(&self, mut x: u64) -> Self {
        let mut ret = ModInt::from_raw(1);
        let mut a = self.clone();

        while x > 0 {
            if (x & 1) == 1 {
                ret = ret * a;
            }

            a *= a;
            x >>= 1;
        }

        return ret;
    }
}

impl<const P: u32> std::ops::Add for ModInt<P> {
    type Output = Self;
    fn add(self, rhs: Self) -> Self::Output {
        let mut ret = self.value() + rhs.value();

        if ret >= P {
            ret -= P;
        }

        return Self::from_raw(ret);
    }
}

impl<const P: u32> std::ops::AddAssign for ModInt<P> {
    fn add_assign(&mut self, rhs: Self) {
        self.value = (self.clone() + rhs).value();
    }
}

impl<const P: u32> std::ops::Sub for ModInt<P> {
    type Output = Self;
    fn sub(self, rhs: Self) -> Self::Output {
        if self.value() >= rhs.value() {
            return Self::from_raw(self.value() - rhs.value());
        } else {
            return Self::from_raw(P + self.value() - rhs.value());
        }
    }
}

impl<const P: u32> std::ops::SubAssign for ModInt<P> {
    fn sub_assign(&mut self, rhs: Self) {
        self.value = (self.clone() - rhs).value();
    }
}

impl<const P: u32> std::ops::Mul for ModInt<P> {
    type Output = Self;
    fn mul(self, rhs: Self) -> Self::Output {
        let ret = self.value() as usize * rhs.value() as usize;
        return Self::from(ret);
    }
}

impl<const P: u32> std::ops::MulAssign for ModInt<P> {
    fn mul_assign(&mut self, rhs: Self) {
        self.value = (self.clone() * rhs).value();
    }
}

impl<const P: u32> std::ops::Div for ModInt<P> {
    type Output = Self;
    fn div(self, rhs: Self) -> Self::Output {
        self * rhs.inv()
    }
}

impl<const P: u32> std::ops::DivAssign for ModInt<P> {
    fn div_assign(&mut self, rhs: Self) {
        self.value = (self.clone() / rhs).value();
    }
}

impl<const P: u32> std::ops::Neg for ModInt<P> {
    type Output = Self;
    fn neg(self) -> Self::Output {
        let value = self.value();
        return Self { value: P - value };
    }
}

macro_rules! int_from_impl {
    ($($t: ty), *) => {
        $(
            #[allow(unused_comparisons)]
            impl<const P: u32> From<$t> for ModInt<P> {
                fn from(value: $t) -> Self {
                    if value >= 0 {
                        Self {
                            value: (value % P as $t) as u32,
                        }
                    } else {
                        let rem = P as $t + value % P as $t;
                        Self { value: rem as u32 }
                    }
                }
            }
        ) *
    };
}

int_from_impl!(usize, isize, u64, i64, u32, i32, u128, i128);

impl<const P: u32> Default for ModInt<P> {
    fn default() -> Self {
        Self { value: 0 }
    }
}

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