結果
問題 | No.1973 Divisor Sequence |
ユーザー | Moss_Local |
提出日時 | 2022-06-10 23:40:16 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 290 ms / 2,000 ms |
コード長 | 6,192 bytes |
コンパイル時間 | 4,778 ms |
コンパイル使用メモリ | 181,744 KB |
実行使用メモリ | 177,604 KB |
最終ジャッジ日時 | 2023-10-21 06:22:42 |
合計ジャッジ時間 | 5,993 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 160 ms
28,516 KB |
testcase_03 | AC | 9 ms
4,348 KB |
testcase_04 | AC | 94 ms
17,436 KB |
testcase_05 | AC | 27 ms
15,184 KB |
testcase_06 | AC | 99 ms
23,968 KB |
testcase_07 | AC | 20 ms
5,496 KB |
testcase_08 | AC | 52 ms
13,336 KB |
testcase_09 | AC | 82 ms
15,392 KB |
testcase_10 | AC | 103 ms
18,812 KB |
testcase_11 | AC | 13 ms
4,348 KB |
testcase_12 | AC | 80 ms
19,548 KB |
testcase_13 | AC | 23 ms
6,888 KB |
testcase_14 | AC | 55 ms
16,308 KB |
testcase_15 | AC | 140 ms
20,460 KB |
testcase_16 | AC | 137 ms
24,552 KB |
testcase_17 | AC | 87 ms
15,976 KB |
testcase_18 | AC | 5 ms
4,348 KB |
testcase_19 | AC | 115 ms
20,520 KB |
testcase_20 | AC | 19 ms
4,760 KB |
testcase_21 | AC | 120 ms
28,972 KB |
testcase_22 | AC | 113 ms
20,604 KB |
testcase_23 | AC | 247 ms
177,604 KB |
testcase_24 | AC | 290 ms
44,812 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> Main.rs:74:15 | 74 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 74 - fn readi() -> (i64) { 74 + fn readi() -> i64 { | warning: use of deprecated function `std::intrinsics::drop_in_place`: no longer an intrinsic - use `ptr::drop_in_place` directly --> Main.rs:17:22 | 17 | use std::intrinsics::drop_in_place; | ^^^^^^^^^^^^^ | = note: `#[warn(deprecated)]` on by default warning: 2 warnings emitted
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::any::Any; use std::cmp::Ordering::*; use std::collections::*; use std::convert::*; use std::convert::{From, Into}; use std::error::Error; use std::f64::consts::PI; use std::fmt::Debug; use std::fmt::Display; use std::fs::File; use std::hash::Hash; use std::intrinsics::drop_in_place; use std::io::prelude::*; use std::io::*; use std::iter::Filter; use std::marker::Copy; use std::mem::*; use std::ops::Bound::*; use std::ops::RangeBounds; use std::ops::{Add, Mul, Neg, Sub}; use std::process; use std::slice::from_raw_parts; use std::str; use std::vec; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; // const FINF: f64 = 122337203685.0; const LINF: i64 = 2147483647; const FINF: f64 = LINF as f64; const INF128: i128 = 1223372036854775807000000000000; const MOD: i64 = 1000000007; // const MOD: i64 = 998244353; const UMOD: usize = MOD as usize; const MPI: f64 = 3.14159265358979323846264338327950288f64; // const MOD: i64 = INF; use std::cmp::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { println!("{}", $x); }; } macro_rules! d { ($x:expr) => { println!("{:?}", $x); }; } fn main() { solve(); } // use str::Chars; #[allow(dead_code)] fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } #[allow(dead_code)] fn readi() -> (i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); iter.next().unwrap().parse::<i64>().unwrap() } #[allow(dead_code)] fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[allow(dead_code)] fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> { (0..n).map(|_| read_vec()).collect() } #[allow(dead_code)] fn readii() -> (i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } fn readff() -> (f64, f64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<f64>().unwrap(), iter.next().unwrap().parse::<f64>().unwrap(), ) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn readcc() -> (char, char) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<char>().unwrap(), iter.next().unwrap().parse::<char>().unwrap(), ) } fn readuuu() -> (usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } #[allow(dead_code)] fn readiiii() -> (i64, i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn prime_factorization(x: usize) -> BTreeMap<usize, usize> { let mut res: BTreeMap<usize, usize> = BTreeMap::new(); let mut xx = x; let mut p: usize = 2; while p * p <= xx { while xx % p == 0 { // println!("{:?}", p); let t = res.get_mut(&p); if t.is_none() { res.insert(p, 1); } else { *t.unwrap() += 1; } xx /= p; } // println!("{:?} {:?}", p, res); p += 1; } if xx != 1 { let t = res.get_mut(&xx); if t.is_none() { res.insert(xx, 1); } else { *t.unwrap() += 1; } } res } fn solve() { let (n, m) = readuu(); let pf = prime_factorization(m); let mut res = 1; for i in pf { let num = i.1; let mut vv = vec![vec![0 as usize; (num + 1) as usize]; (n) as usize]; for j in 0..=num { vv[0][j] = 1; } for j in 1..n { let mut su = 0; for k in (0..=num).rev() { su += vv[j - 1][num - k]; su %= UMOD; vv[j][k] = su; } } let mut r = 0; for j in 0..=num { r += vv[n - 1][j]; r %= UMOD; } res *= r; res %= UMOD; } p!(res); return; }