結果
問題 | No.1657 Sum is Prime (Easy Version) |
ユーザー | akakimidori |
提出日時 | 2021-08-27 21:35:14 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 1,351 ms / 2,000 ms |
コード長 | 2,967 bytes |
コンパイル時間 | 6,894 ms |
コンパイル使用メモリ | 140,136 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-08-13 08:10:47 |
合計ジャッジ時間 | 9,358 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1,143 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 3 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,384 KB |
testcase_11 | AC | 10 ms
4,380 KB |
testcase_12 | AC | 1,035 ms
4,380 KB |
testcase_13 | AC | 447 ms
4,376 KB |
testcase_14 | AC | 494 ms
4,380 KB |
testcase_15 | AC | 667 ms
4,376 KB |
testcase_16 | AC | 192 ms
4,380 KB |
testcase_17 | AC | 32 ms
4,384 KB |
testcase_18 | AC | 83 ms
4,384 KB |
testcase_19 | AC | 1,177 ms
4,376 KB |
testcase_20 | AC | 284 ms
4,380 KB |
testcase_21 | AC | 1,351 ms
4,380 KB |
testcase_22 | AC | 1 ms
4,376 KB |
testcase_23 | AC | 114 ms
4,380 KB |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> Main.rs:97:5 | 97 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: type alias `Map` is never used --> Main.rs:100:6 | 100 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Set` is never used --> Main.rs:101:6 | 101 | type Set<T> = BTreeSet<T>; | ^^^ warning: type alias `Deque` is never used --> Main.rs:102:6 | 102 | type Deque<T> = VecDeque<T>; | ^^^^^ warning: 4 warnings emitted
ソースコード
// ---------- begin miller-rabin ---------- fn is_prime_miller(n: u64) -> bool { if n <= 1 { return false; } else if n <= 3 { return true; } else if n % 2 == 0 { return false; } let pow = |r: u64, mut m: u64| -> u64 { let mut t = 1u128; let mut s = (r % n) as u128; let n = n as u128; while m > 0 { if m & 1 == 1 { t = t * s % n; } s = s * s % n; m >>= 1; } t as u64 }; let mut d = n - 1; let mut s = 0; while d % 2 == 0 { d /= 2; s += 1; } const B: [u64; 7] = [2, 325, 9375, 28178, 450775, 9780504, 1795265022]; for &b in B.iter() { let mut a = pow(b, d); if a <= 1 { continue; } let mut i = 0; while i < s && a != n - 1 { i += 1; a = (a as u128 * a as u128 % n as u128) as u64; } if i >= s { return false; } } true } // ---------- end miller-rabin ---------- // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { l: u64, r: u64, } let mut ans = 0; for a in l..=r { for b in a..=(a + 2).min(r) { let v = (a + b) * (b + 1 - a) / 2; if is_prime_miller(v) { ans += 1; } } } println!("{}", ans); } fn main() { run(); }