結果
問題 | No.741 AscNumber(Easy) |
ユーザー | hatoo |
提出日時 | 2018-10-15 12:42:06 |
言語 | Rust (1.72.1) |
結果 |
AC
|
実行時間 | 389 ms / 2,000 ms |
コード長 | 3,323 bytes |
コンパイル時間 | 1,953 ms |
コンパイル使用メモリ | 154,172 KB |
実行使用メモリ | 118,132 KB |
最終ジャッジ日時 | 2023-08-02 20:16:11 |
合計ジャッジ時間 | 8,575 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,384 KB |
testcase_05 | AC | 1 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,384 KB |
testcase_07 | AC | 1 ms
4,384 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,508 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,384 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,384 KB |
testcase_24 | AC | 1 ms
4,384 KB |
testcase_25 | AC | 1 ms
4,384 KB |
testcase_26 | AC | 1 ms
4,384 KB |
testcase_27 | AC | 1 ms
4,380 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 1 ms
4,384 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,380 KB |
testcase_32 | AC | 1 ms
4,380 KB |
testcase_33 | AC | 1 ms
4,384 KB |
testcase_34 | AC | 1 ms
4,384 KB |
testcase_35 | AC | 372 ms
112,688 KB |
testcase_36 | AC | 163 ms
49,696 KB |
testcase_37 | AC | 191 ms
58,280 KB |
testcase_38 | AC | 188 ms
57,548 KB |
testcase_39 | AC | 160 ms
48,572 KB |
testcase_40 | AC | 214 ms
65,940 KB |
testcase_41 | AC | 337 ms
102,868 KB |
testcase_42 | AC | 181 ms
54,984 KB |
testcase_43 | AC | 131 ms
39,932 KB |
testcase_44 | AC | 266 ms
80,836 KB |
testcase_45 | AC | 284 ms
86,952 KB |
testcase_46 | AC | 353 ms
107,096 KB |
testcase_47 | AC | 62 ms
18,956 KB |
testcase_48 | AC | 354 ms
107,380 KB |
testcase_49 | AC | 294 ms
89,628 KB |
testcase_50 | AC | 42 ms
12,948 KB |
testcase_51 | AC | 137 ms
42,040 KB |
testcase_52 | AC | 387 ms
118,132 KB |
testcase_53 | AC | 389 ms
118,072 KB |
testcase_54 | AC | 375 ms
116,972 KB |
ソースコード
#[doc = " https://github.com/hatoo/competitive-rust-snippets"] #[allow(unused_imports)] use std::cmp::{max, min, Ordering}; #[allow(unused_imports)] use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque}; #[allow(unused_imports)] use std::io::{stdin, stdout, BufWriter, Write}; #[allow(unused_imports)] use std::iter::FromIterator; mod util { use std::fmt::Debug; use std::io::{stdin, stdout, BufWriter, StdoutLock}; use std::str::FromStr; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn chars() -> Vec<char> { line().chars().collect() } #[allow(dead_code)] pub fn gets<T: FromStr>() -> Vec<T> where <T as FromStr>::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } #[allow(dead_code)] pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) { let out = stdout(); let writer = BufWriter::new(out.lock()); f(writer) } } #[allow(unused_macros)] macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ t : ty ;; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ;; ) ) . collect ::< Vec < _ >> ( ) } ; } #[allow(unused_macros)] macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } } const BIG_STACK_SIZE: bool = true; #[allow(dead_code)] fn main() { use std::thread; if BIG_STACK_SIZE { thread::Builder::new() .stack_size(32 * 1024 * 1024) .name("solve".into()) .spawn(solve) .unwrap() .join() .unwrap(); } else { solve(); } } #[allow(dead_code)] pub const M: u64 = 1_000_000_007; fn solve() { let n = get!(usize); // let n = 2; let mut dp = vec![vec![0; 10]; n + 1]; for i in 0..n { for j in 0..10 { if j > 0 { dp[i + 1][j] += 1; } for k in 0..j + 1 { dp[i + 1][j] += dp[i][k]; dp[i + 1][j] %= M; } } } let ans = dp[n].iter().sum::<u64>(); println!("{}", (ans + 1) % M); }