結果
問題 | No.2016 Countdown Divisors |
ユーザー | Moss_Local |
提出日時 | 2022-07-22 21:32:41 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 133 ms / 2,000 ms |
コード長 | 5,607 bytes |
コンパイル時間 | 12,831 ms |
コンパイル使用メモリ | 393,260 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-04 05:31:53 |
合計ジャッジ時間 | 16,459 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 133 ms
5,248 KB |
testcase_02 | AC | 128 ms
5,376 KB |
testcase_03 | AC | 114 ms
5,376 KB |
testcase_04 | AC | 98 ms
5,376 KB |
testcase_05 | AC | 101 ms
5,376 KB |
testcase_06 | AC | 34 ms
5,376 KB |
testcase_07 | AC | 33 ms
5,376 KB |
testcase_08 | AC | 119 ms
5,376 KB |
testcase_09 | AC | 122 ms
5,376 KB |
testcase_10 | AC | 120 ms
5,376 KB |
testcase_11 | AC | 122 ms
5,376 KB |
testcase_12 | AC | 122 ms
5,376 KB |
testcase_13 | AC | 125 ms
5,376 KB |
testcase_14 | AC | 113 ms
5,376 KB |
testcase_15 | AC | 111 ms
5,376 KB |
testcase_16 | AC | 127 ms
5,376 KB |
testcase_17 | AC | 113 ms
5,376 KB |
testcase_18 | AC | 116 ms
5,376 KB |
testcase_19 | AC | 1 ms
5,376 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:72:15 | 72 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 72 - fn readi() -> (i64) { 72 + fn readi() -> i64 { | warning: use of deprecated function `std::intrinsics::drop_in_place`: no longer an intrinsic - use `ptr::drop_in_place` directly --> src/main.rs:16:22 | 16 | use std::intrinsics::drop_in_place; | ^^^^^^^^^^^^^ | = note: `#[warn(deprecated)]` on by default warning: unused variable: `i` --> src/main.rs:210:9 | 210 | for i in 0..n { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default
ソースコード
// -*- 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::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::iter::FromIterator; use std::marker::Copy; use std::mem::*; use std::ops::BitAnd; 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 LINF: i64 = 2147483647; const INF128: i128 = 1223372036854775807000000000000; // const MOD: i64 = 1000000007; const MOD: i64 = 998244353; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // 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(), ) } #[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 solve_part() { let n: usize = read(); if n == 1 || n == 3 || n == 4 || n == 5 || n == 7 || n == 8 { p!(1); } else { p!(2); } return; } fn divisors(n: usize) -> Vec<usize> { let mut divisors = Vec::new(); // n := i * x とおくと、 i が i > root(n) の時、 i はすでに ある x に探索されているから // i <= root(n) まで探索すればよい for i in 1..=(f64::sqrt(n as f64) + 1e-9) as usize { // i で n が割り切れた場合 if n % i == 0 { // 約数リストに格納 divisors.push(i); // n := i * x の x を格納。ただし x := i の時は除く if i != n / i { divisors.push(n / i); } } } divisors.sort(); divisors } fn solve() { // let mut res = vec![0; 100]; // res[0] = 0; // res[1] = 1; // res[2] = 2; // for i in 3..100 { // let x = i - divisors((i)).len(); // res[i] = res[x]; // } // d!(res); let n: usize = read(); for i in 0..n { solve_part(); } return; }