Submit Info #6664

Problem Lang User Status Time Memory
Montmort Number rust cottoncotton AC 62 ms 10.05 MiB

ケース詳細
Name Status Time Memory
example_00 AC 1 ms 0.72 MiB
example_01 AC 2 ms 0.67 MiB
max_00 AC 62 ms 9.72 MiB
max_01 AC 55 ms 9.86 MiB
max_02 AC 54 ms 10.05 MiB
random_00 AC 21 ms 4.17 MiB
random_01 AC 26 ms 4.72 MiB
random_02 AC 31 ms 6.09 MiB
random_03 AC 24 ms 4.67 MiB
random_04 AC 46 ms 8.05 MiB

#![allow(unused)] use kyoproio::*; use std::{ collections::*, io::{self, prelude::*}, iter, mem::{replace, swap}, }; fn main() -> io::Result<()> { std::thread::Builder::new() .stack_size(50 * 1024 * 1024) .spawn(solve)? .join() .unwrap(); Ok(()) } fn solve() { let stdin = io::stdin(); let mut kin = KInput::new(stdin.lock()); let stdout = io::stdout(); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+) }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!() }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } } } let (n, m): (u64, u64) = kin.input(); if n == 1 { outputln!("1"); return; } let mut a = 0; let mut b = 1 % m; output!("{} {}", a, b); for i in 3..=n { let c = ((i - 1) * a + (i - 1) * b) % m; output!(" {}", c); a = b; b = c; } outputln!(); } // ----------------------------------------------------------------------------- pub mod kyoproio { #![warn(unused)] use std::io::prelude::*; pub trait Input: Sized { fn str(&mut self) -> &str; fn bytes(&mut self) -> &[u8] { self.str().as_ref() } fn input<T: InputParse>(&mut self) -> T { self.input_fallible().expect("input error") } fn input_fallible<T: InputParse>(&mut self) -> Result<T, T::Err> { T::input(self) } fn iter<T: InputParse>(&mut self) -> Iter<T, Self> { Iter { input: self, _t: std::marker::PhantomData, } } fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B { self.iter().take(n).collect() } } pub struct KInput<R> { src: R, buf: String, pos: usize, } impl<R: BufRead> KInput<R> { pub fn new(src: R) -> Self { Self { src, buf: String::with_capacity(1024), pos: 0, } } } impl<R: BufRead> Input for KInput<R> { fn str(&mut self) -> &str { loop { if self.pos >= self.buf.len() { self.pos = 0; self.buf.clear(); if self.src.read_line(&mut self.buf).expect("io error") == 0 { return &self.buf; } } let range = self.pos ..self.buf[self.pos..] .find(|c: char| c.is_ascii_whitespace()) .map(|i| i + self.pos) .unwrap_or_else(|| self.buf.len()); self.pos = range.end + 1; if range.end > range.start { return &self.buf[range]; } } } } pub struct Iter<'a, T, I> { input: &'a mut I, _t: std::marker::PhantomData<*const T>, } impl<'a, T: InputParse, I: Input> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option<Self::Item> { Some(self.input.input()) } } pub trait InputParse: Sized { type Err: std::fmt::Debug; fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err>; } macro_rules! from_str_impls { { $($T:ty)* } => { $(impl InputParse for $T { type Err = <$T as std::str::FromStr>::Err; fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> { input.str().parse::<$T>() } })* }; } from_str_impls! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impls { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { type Err = (); fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> { // ? Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*)) } } tuple_impls!($($T)*); }; () => {}; } tuple_impls!(A B C D E F G); }