//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::>() }; ($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") }; } // fn run() { input! { n: usize, k: u32, a: [u32; n], } let mut dp = vec![Some(std::collections::BTreeSet::new()); 1 << n]; dp[(1 << n) - 1].as_mut().unwrap().insert(k); for i in (1..(1 << n)).rev() { let set = dp[i].take().unwrap(); for (j, a) in a.iter().enumerate() { if i >> j & 1 == 1 { let x = i ^ (1 << j); let p = dp[x].as_mut().unwrap(); for &v in set.iter() { p.insert(v % *a); } } } } let ans = *dp[0].take().unwrap().iter().max().unwrap(); println!("{}", ans); } fn main() { run(); }