結果

問題 No.1081 和の和
ユーザー kaki
提出日時 2020-06-19 21:27:31
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 4,483 bytes
コンパイル時間 13,275 ms
コンパイル使用メモリ 402,204 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-03 13:50:03
合計ジャッジ時間 14,263 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]
use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;
struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}
macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}
impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }
    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }
    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }
    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }
    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }
    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }
    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }
    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }
    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }
    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}
use std::ops::*;
use std::fmt;
#[derive(Copy, Clone, PartialEq, Debug)]
struct ModInt(usize);
const MOD: usize = 1000000007;
impl ModInt {
    fn pow(self, power: usize) -> Self {
        if power == 0 {
            return ModInt(1);
        }
        if power % 2 == 0 {
            let t = self.pow(power/2);
            return t * t;
        }
        self * self.pow(power-1)
    }
    fn inv(self) -> Self {
        self.pow(MOD - 2)
    }
}
impl Add for ModInt {
    type Output = Self;
    fn add(self, rhs: Self) -> Self {
        let mut tmp = self;
        tmp.0 += rhs.0;
        if tmp.0 >= MOD {
            tmp.0 -= MOD;
        }
        tmp
    }
}
impl AddAssign for ModInt {
    fn add_assign(&mut self, rhs: Self) {
        *self = *self + rhs;
    }
}
impl Sub for ModInt {
    type Output = Self;
    fn sub(self, rhs: Self) -> Self {
        let mut ret = self;
        if ret.0 < rhs.0 {
            ret.0 += MOD;
        }
        ret.0 -= rhs.0;
        ret
    }
}
impl SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: Self) {
        *self = *self - rhs;
    }
}
impl Mul for ModInt {
    type Output = Self;
    fn mul(self, rhs: ModInt) -> Self {
        let mut ret = self;
        ret.0 *= rhs.0;
        ret.0 %= MOD;
        ret
    }
}
impl MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: Self) {
        *self = *self * rhs;
    }
}
impl Div for ModInt {
    type Output = ModInt;
    fn div(self, rhs: ModInt) -> Self {
        let mut ret = self;
        ret.0 *= rhs.inv().0;
        ret.0 %= MOD;
        ret
    }
}
impl DivAssign for ModInt {
    fn div_assign(&mut self, rhs: Self) {
        *self = *self / rhs;
    }
}
impl fmt::Display for ModInt {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "{}", self.0)
    }
}
fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let mut A = vec![ModInt(0); N];
    for i in 0..N {
        let a: usize = sc.get();
        A[i] = ModInt(a);
    }
    for _ in 0..N-1 {
        let mut nA = vec![ModInt(0); A.len()-1];
        for i in 0..nA.len() {
            nA[i] = A[i] + A[i+1];
        }
        A = nA;
    }
    println!("{}", A[0]);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0