結果
問題 | No.944 煎っぞ! |
ユーザー | manta1130 |
提出日時 | 2019-12-07 20:49:14 |
言語 | Rust (1.72.1) |
結果 |
AC
|
実行時間 | 492 ms / 3,000 ms |
コード長 | 3,848 bytes |
コンパイル時間 | 3,559 ms |
コンパイル使用メモリ | 147,920 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-08-27 02:13:40 |
合計ジャッジ時間 | 8,467 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
4,380 KB |
testcase_01 | AC | 42 ms
4,380 KB |
testcase_02 | AC | 51 ms
4,376 KB |
testcase_03 | AC | 48 ms
4,380 KB |
testcase_04 | AC | 70 ms
4,376 KB |
testcase_05 | AC | 27 ms
4,376 KB |
testcase_06 | AC | 37 ms
4,376 KB |
testcase_07 | AC | 52 ms
4,376 KB |
testcase_08 | AC | 80 ms
4,380 KB |
testcase_09 | AC | 29 ms
4,380 KB |
testcase_10 | AC | 4 ms
4,376 KB |
testcase_11 | AC | 76 ms
4,376 KB |
testcase_12 | AC | 44 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 74 ms
4,376 KB |
testcase_15 | AC | 36 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,376 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 76 ms
4,380 KB |
testcase_19 | AC | 75 ms
4,376 KB |
testcase_20 | AC | 188 ms
4,376 KB |
testcase_21 | AC | 205 ms
4,380 KB |
testcase_22 | AC | 38 ms
4,376 KB |
testcase_23 | AC | 57 ms
4,380 KB |
testcase_24 | AC | 87 ms
4,376 KB |
testcase_25 | AC | 47 ms
4,376 KB |
testcase_26 | AC | 40 ms
4,380 KB |
testcase_27 | AC | 492 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 348 ms
4,380 KB |
testcase_31 | AC | 20 ms
4,376 KB |
testcase_32 | AC | 17 ms
4,376 KB |
testcase_33 | AC | 173 ms
4,384 KB |
testcase_34 | AC | 204 ms
4,376 KB |
コンパイルメッセージ
warning: variable `n` is assigned to, but never used --> Main.rs:112:9 | 112 | let n: usize; | ^ | = note: consider using `_n` instead = note: `#[warn(unused_variables)]` on by default warning: value assigned to `n` is never read --> Main.rs:113:12 | 113 | input!(n); | ^ | = help: maybe it is overwritten before being read? = note: `#[warn(unused_assignments)]` on by default warning: 2 warnings emitted
ソースコード
// ____ _ _ _ _ // | _ \ _ _ ___| |_ ___ _ __ | |_ ___ _ __ ___ _ __ | | __ _| |_ ___ // | |_) | | | / __| __| / __| '_ \ | __/ _ \ '_ ` _ \| '_ \| |/ _` | __/ _ \ // | _ <| |_| \__ \ |_ | (__| |_) | | || __/ | | | | | |_) | | (_| | || __/ // |_| \_\\__,_|___/\__| \___| .__/___\__\___|_| |_| |_| .__/|_|\__,_|\__\___| // |_| |_____| |_| //https://github.com/manta1130/Competitive_Programming_Template_Rust #[macro_use] mod input { use std; use std::io; const SPLIT_DELIMITER: char = ' '; #[macro_export] #[allow(unused_macros)] macro_rules! input { ( $($x:expr ),*) => { { let temp_str = input_line_str(); let mut split_result_iter = temp_str.split_whitespace(); $( let buf_split_result = split_result_iter.next(); let buf_split_result = buf_split_result.unwrap(); ($x) = buf_split_result.parse().unwrap(); )* } }; } #[allow(dead_code)] pub fn input_line_str() -> String { let mut s = String::new(); io::stdin().read_line(&mut s).unwrap(); s.trim().to_string() } #[allow(dead_code)] pub fn p<T>(t: T) where T: std::fmt::Display, { println!("{}", t); } #[allow(dead_code)] pub fn input_vector2d<T>(line: usize) -> Vec<Vec<T>> where T: std::str::FromStr, { let mut v: Vec<Vec<T>> = Vec::new(); for _ in 0..line { let vec_line = input_vector(); v.push(vec_line); } v } #[allow(dead_code)] pub fn input_vector<T>() -> Vec<T> where T: std::str::FromStr, { let mut v: Vec<T> = Vec::new(); let s = input_line_str(); let split_result = s.split(SPLIT_DELIMITER); for z in split_result { let buf = match z.parse() { Ok(r) => r, Err(_) => panic!("Parse Error"), }; v.push(buf); } v } #[allow(dead_code)] pub fn input_vector_row<T>(n: usize) -> Vec<T> where T: std::str::FromStr, { let mut v = Vec::with_capacity(n); for _ in 0..n { let buf = match input_line_str().parse() { Ok(r) => r, Err(_) => panic!("Parse Error"), }; v.push(buf); } v } pub trait ToCharVec { fn to_charvec(&self) -> Vec<char>; } impl ToCharVec for String { fn to_charvec(&self) -> Vec<char> { self.to_string().chars().collect::<Vec<_>>() } } } use input::*; fn main() { let n: usize; input!(n); let a = input_vector::<usize>(); let mut sum = 0; let mut v = vec![]; for z in a { sum += z; v.push(sum); } let mut ans = 0; let mut i = 0; while i * i <= sum { i += 1; if sum % i != 0 { continue; } let mut j = i; let mut count = 0; let mut flag = true; while j <= sum { if let Ok(_) = v.binary_search(&j) { count += 1; } else { flag = false; } j += i; } if flag { ans = std::cmp::max(ans, count); } let mut j = sum / i; let mut count = 0; let mut flag = true; while j <= sum { if let Ok(_) = v.binary_search(&j) { count += 1; } else { flag = false; } j += sum / i; } if flag { ans = std::cmp::max(ans, count); } } p(ans); }