fn main() { input! { n: usize, cond: [(u32, u32); n], } let m = cond[n - 1].0; let mut hist = vec![0; m as usize + 1]; let mut cnt = 0; for (p, e) in cond { hist[p as usize] += e; cnt += 1; } let sieve = Sieve::new(m as usize); for i in 1..m { for &(n, sign) in [(m + 1 - i, !0), (i, 1)].iter() { let mut n = n as u32; while let Some(p) = sieve.factor(n as usize) { let hist = &mut hist[p]; cnt -= (*hist != 0) as u32; let p = p as u32; while n % p == 0 { n /= p; *hist += sign; } cnt += (*hist != 0) as u32; } } if cnt == 0 { println!("{} {}", m, i); return; } } println!("-1 -1"); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] 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_export] 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_export] 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::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // --------- end sieve ---------- pub struct Sieve { size: usize, factor: Vec, } impl Sieve { pub fn new(size: usize) -> Sieve { let mut factor = (0..(size + 1)).collect::>(); for i in (2..).take_while(|p| p * p <= size) { if i == factor[i] { for j in i..(size / i + 1) { factor[j * i] = i; } } } Sieve { size: size, factor: factor, } } pub fn factor(&self, n: usize) -> Option { assert!(n <= self.size); if n == 1 { None } else { Some(self.factor[n]) } } pub fn factorize(&self, mut n: usize, res: &mut Vec) { assert!(n <= self.size); res.clear(); res.push(1); while let Some(p) = self.factor(n) { let len = res.len(); while n % p == 0 { n /= p; for _ in 0..len { let v = res[res.len() - len] * p; res.push(v); } } } } } // --------- end sieve ----------