結果

問題 No.1407 Kindness
ユーザー StrorkisStrorkis
提出日時 2021-02-26 22:00:21
言語 Rust
(1.83.0 + proconio)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,891 bytes
コンパイル時間 13,178 ms
コンパイル使用メモリ 388,720 KB
最終ジャッジ日時 2024-11-15 00:10:02
合計ジャッジ時間 13,897 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
error: format argument must be a string literal
 --> src/main.rs:8:34
  |
8 |                 Err(e) => panic!(e), 
  |                                  ^
  |
help: you might be missing a string literal to format with
  |
8 |                 Err(e) => panic!("{}", e), 
  |                                  +++++

error: could not compile `main` (bin "main") due to 1 previous error

ソースコード

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

mod io {
pub fn scan<R: std::io::BufRead>(r: &mut R) -> Vec<u8> {
let mut res = Vec::new();
loop {
let buf = match r.fill_buf() {
Ok(buf) => buf,
Err(e) if e.kind() == std::io::ErrorKind::Interrupted => continue,
Err(e) => panic!(e),
};
let (done, used, buf) = {
match buf.iter().position(u8::is_ascii_whitespace) {
Some(i) => (i > 0 || res.len() > 0, i + 1, &buf[..i]),
None => (buf.is_empty(), buf.len(), buf),
}
};
res.extend_from_slice(buf);
r.consume(used);
if done { return res; }
}
}
}
#[allow(dead_code)]
mod mod_int {
#[derive(Clone, Copy)]
pub struct ModInt(pub i64);
impl ModInt {
const MOD: i64 = 1_000_000_007;
pub fn new(x: i64) -> ModInt {
Self(x % Self::MOD)
}
}
impl std::ops::Add for ModInt {
type Output = Self;
fn add(self, other: Self) -> Self {
let x = self.0 + other.0;
if x < Self::MOD { Self(x) } else { Self(x - Self::MOD) }
}
}
impl std::ops::AddAssign for ModInt {
fn add_assign(&mut self, other: Self) {
*self = *self + other;
}
}
impl std::ops::Sub for ModInt {
type Output = Self;
fn sub(self, other: Self) -> Self {
if self.0 < other.0 {
Self(self.0 + Self::MOD - other.0)
} else {
Self(self.0 - other.0)
}
}
}
impl std::ops::SubAssign for ModInt {
fn sub_assign(&mut self, other: Self) {
*self = *self - other;
}
}
impl std::ops::Mul for ModInt {
type Output = Self;
fn mul(self, other: Self) -> Self {
Self::new(self.0 * other.0)
}
}
impl std::ops::MulAssign for ModInt {
fn mul_assign(&mut self, other: Self) {
*self = *self * other;
}
}
impl std::fmt::Display for ModInt {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "{}", self.0)
}
}
impl From<usize> for ModInt {
fn from(x: usize) -> Self {
Self(x as i64)
}
}
}
use mod_int::ModInt;
#[allow(unused_macros)]
fn run<R: std::io::BufRead, W: std::io::Write>(reader: &mut R, writer: &mut W) {
macro_rules! scan {
([$t:tt; $n:expr]) => ((0..$n).map(|_| scan!($t)).collect::<Vec<_>>());
(($($t:tt),*)) => (($(scan!($t)),*));
([u8]) => (io::scan(reader));
(String) => (unsafe { String::from_utf8_unchecked(scan!([u8])) });
($t:ty) => (scan!(String).parse::<$t>().unwrap());
}
macro_rules! print {
($($arg:tt)*) => (write!(writer, $($arg)*).ok());
}
macro_rules! println {
($($arg:tt)*) => (writeln!(writer, $($arg)*).ok());
}
let n = scan!([u8]);
let mut dp = [ModInt(1), ModInt(0)];
for (k, d) in n.into_iter().enumerate() {
let d = (d - b'0') as usize;
let mut next = [ModInt(0), ModInt(0)];
for i in 1..10 {
let v = ModInt::from(i);
if i < d {
next[1] += (dp[0] + dp[1]) * v;
} else if i == d {
next[0] += dp[0] * v;
next[1] += dp[1] * v;
} else {
next[1] += dp[1] * v;
}
if k > 0 {
next[1] += v;
}
}
dp = next;
}
println!("{}", dp[0] + dp[1]);
}
fn main() {
let (stdin, stdout) = (std::io::stdin(), std::io::stdout());
let mut reader = std::io::BufReader::new(stdin.lock());
let mut writer = std::io::BufWriter::new(stdout.lock());
run(&mut reader, &mut writer);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0