結果
| 問題 | No.3448 ABBBBBBBBC |
| コンテスト | |
| ユーザー |
 Solalyth
|
| 提出日時 | 2026-02-22 16:29:03 |
| 言語 | Rust (1.93.0 + proconio + num + itertools) |
| 結果 |
AC
|
| 実行時間 | 47 ms / 2,000 ms |
| コード長 | 32,585 bytes |
| 記録 | |
| コンパイル時間 | 13,626 ms |
| コンパイル使用メモリ | 230,176 KB |
| 実行使用メモリ | 7,844 KB |
| 最終ジャッジ日時 | 2026-02-22 16:29:18 |
| 合計ジャッジ時間 | 15,175 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 4 |
ソースコード
#![allow(unused_must_use, non_snake_case, unused_labels, unused_imports, non_upper_case_globals)]
use external::*;
use cplib::prelude::*;
use nest as vec;
const INTERACTIVE: bool = false;
// const INTERACTIVE: bool = true; use input_interactive as input;
// #[allow(dead_code)] type Mint = ac_library::ModInt998244353;
fn solve() {
input! {
T: usize
}
let mut A = vec![];
for i in 100..1000 {
let a = math::func::into_ary(i, 10);
if a[0] != a[1] && a[1] != a[2] && a[2] != a[0] { A.push([a[0], a[1], a[2]]); }
}
for _ in 0..T {
input! {
N: usize, mut K: usize
}
K -= 1;
let a = K/(72*N) + 1;
K %= 72*N;
let mut b = K/(8*N);
if a <= b { b += 1; }
K %= 8*N;
let (mut c, mut d) = (0, 0);
for i in 0..10 {
if i == a || i == b { continue; }
if i < b { c += 1; } else { d += 1; }
}
epr!("a={a}, b={b}, c={c}, d={d}");
if K < c*N {
let t = K/c;
let mut u = K%c;
if a <= u { u += 1; }
out << 3+t << a << b << u;
} else {
K = 8*N-1 - K;
let t = K/d;
let mut u = 9 - K%d;
if u <= a { u -= 1; }
out << 3+t << a << b << u;
}
out << end;
}
}
fn main() { out::init(INTERACTIVE || !SUBMISSION); solve(); out::print() }
mod external { pub use { proconio::{ input, input_interactive, marker::{Chars as chars, Usize1 as usize1} }, }; }
// my library: https://github.com/solalyth/cplib-rs
mod cplib { #![allow(unused_macros, dead_code)] pub const SUBMISSION: bool = true; pub mod prelude { pub use std::{ collections::{VecDeque, HashMap, HashSet, BTreeMap, BTreeSet, BinaryHeap}, cmp::{Ordering, Reverse}, mem::{replace, take} }; pub use crate::cplib::{ *, SUBMISSION, ds::{unionfind::UnionFind, segtree::*, csr::CSR}, algo::func::*, math::{modtable::O, lpf_sieve::*}, util::{output::{out, end}, traits::*, debug::epr_table}, }; } pub mod ds { pub mod unionfind { use std::fmt::Debug; pub trait Abelian { type T: Clone + Eq; fn e() -> Self::T; fn add(l: &Self::T, r: &Self::T) -> Self::T; fn inv(x: &Self::T) -> Self::T; fn sub(l: &Self::T, r: &Self::T) -> Self::T { Self::add(l, &Self::inv(r)) } } pub struct Nop; impl Abelian for Nop { type T = (); fn e() {} fn add(_: &(), _: &()) {} fn inv(_: &()) {} } pub struct UnionFind<Op: Abelian> { par: Vec<usize>, size: Vec<usize>, diff: Vec<Op::T>, next: Vec<usize> } impl UnionFind<Nop> { pub fn new_nop(len: usize) -> Self { Self::new(len) } } impl<Op: Abelian> UnionFind<Op> { pub fn new(len: usize) -> Self { UnionFind { par: (0..len).collect(), size: vec![1; len], diff: vec![Op::e(); len], next: (0..len).collect() } } pub fn clear(&mut self) { for i in 0..self.len() { self.par[i] = i; self.size[i] = 1; self.diff[i] = Op::e(); self.next[i] = i; } } pub fn extend(&mut self, len: usize) { let bef = self.len(); self.par.extend(bef..len); self.size.resize(len, 1); self.diff.resize(len, Op::e()); self.next.extend(bef..len); } pub fn len(&self) -> usize { self.par.len() } pub fn leader(&mut self, i: usize) -> usize { loop { let p = self.par[i]; let g = self.par[p]; if p == g { return g; } self.diff[i] = Op::add(&self.diff[i], &self.diff[p]); self.par[i] = g; } } pub fn size(&mut self, mut i: usize) -> usize { i = self.leader(i); self.size[i] } pub fn is_same(&mut self, i: usize, j: usize) -> bool { self.leader(i) == self.leader(j) } pub fn diff(&mut self, i: usize, j: usize) -> Op::T { assert!(self.is_same(i, j)); Op::sub(&self.diff[i], &self.diff[j]) } pub fn merge(&mut self, i: usize, j: usize, mut w: Op::T) -> (usize, usize) { let (mut old, mut new) = (self.leader(i), self.leader(j)); w = Op::sub(&Op::add(&w, &self.diff[j]), &self.diff[i]); if old == new { return if w == Op::e() { (old, !0) } else { (!0, !0) } } if !(self.size[old] <= self.size[new]) { (old, new) = (new, old); w = Op::inv(&w); } self.par[old] = new; self.diff[old] = w; self.size[new] += self.size[old]; self.next.swap(i, j); (new, old) } pub fn size_undo(&self, new: usize, old: usize) -> (usize, usize) { (self.size[new] - self.size[old], self.size[old]) } pub fn groups(&mut self) -> Vec<Vec<usize>> { let mut res = crate::nest![void; self.len()]; for i in 0..self.len() { res[self.leader(i)].push(i); } res } pub fn group(&self, i: usize) -> Vec<usize> { let (mut res, mut j) = (vec![i], self.next[i]); while j != i { res.push(j); j = self.next[j]; } res } pub fn leaders(&self) -> Vec<usize> { (0..self.len()).filter(|&i| self.par[i] == i).collect() } } impl<Op: Abelian> Clone for UnionFind<Op> { fn clone(&self) -> Self { Self { par: self.par.clone(), size: self.size.clone(), diff: self.diff.clone(), next: self.next.clone() } } } impl<Op: Abelian> std::fmt::Debug for UnionFind<Op> where Op::T: Debug { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { let g = self.clone().groups(); let mut s = String::new(); if std::any::type_name::<Op::T>() == "()" { for g in g { if !g.is_empty() { s += &format!("{g:?}, "); } } } else { panic!(); } write!(f, "[ {} ]", &s[..s.len()-2]) } } } pub mod segtree { use std::{fmt::Debug, mem::replace, ops::{Index, IndexMut, RangeBounds}, slice::SliceIndex}; use crate::cplib::util::func::to_bounds; #[allow(unused_variables)] pub trait SegtreeOp: Sized { const BEATS: bool = false; type Value: Clone + Debug; type Lazy: Clone; fn id_value() -> Self::Value; fn prod_value(lhs: &Self::Value, rhs: &Self::Value) -> Self::Value; fn act_value(value: &mut Self::Value, lazy: &Self::Lazy) -> bool { true } fn prod_lazy(lazy: &mut Self::Lazy, ad: &Self::Lazy) {} fn segtree_new(len: usize) -> Segtree<Self> { Segtree::new(len) } fn segtree_from_iter(iter: impl IntoIterator<Item = Self::Value>) -> Segtree<Self> { Segtree::from_iter(iter) } } pub struct Segtree<Op: SegtreeOp> { tree: Vec<Op::Value>, lazy: Vec<Option<Op::Lazy>>, depth: u32 } impl<Op: SegtreeOp> Segtree<Op> { pub fn new(len: usize) -> Self { let depth = (len.max(2)-1).ilog2() + 2; Segtree { tree: vec![Op::id_value(); 1<<depth], lazy: vec![None; 1<<depth], depth } } pub fn len(&self) -> usize { 1 << self.depth-1 } pub fn get(&mut self, mut i: usize) -> &Op::Value { i += self.len(); for j in (1..self.depth).rev() { self.push(i >> j); } &self.tree[i] } #[track_caller] pub fn set<T>(&mut self, mut i: usize, f: impl FnOnce(&mut Op::Value) -> T) -> T { i += self.len(); for j in (1..self.depth).rev() { self.push(i >> j); } let res = f(&mut self.tree[i]); for j in 1..self.depth { self.update(i >> j); } res } pub fn push_all(&mut self) { for i in 1..self.len() { self.push(i); } } pub fn fold(&mut self, range: impl RangeBounds<usize>) -> Op::Value { let [mut l, mut r] = to_bounds(range, self.len()).map(|v| v+self.len()); if r == self.len() { return Op::id_value(); } let (mut rl, mut rr) = (Op::id_value(), Op::id_value()); for i in (1..self.depth).rev() { self.push(l >> i); self.push(r-1 >> i); } while l < r { if l&1 == 1 { rl = Op::prod_value(&rl, &self.tree[l]); l += 1; } if r&1 == 1 { rr = Op::prod_value(&self.tree[r-1], &rr); } l >>= 1; r >>= 1; } Op::prod_value(&rl, &rr) } pub fn apply(&mut self, range: impl RangeBounds<usize>, lazy: Op::Lazy) { let [l, r] = to_bounds(range, self.len()).map(|v| v + self.len()); if r == self.len() { return; } for i in (1..self.depth).rev() { self.push(l >> i); self.push(r-1 >> i); } let (mut s, mut t) = (l, r); while s < t { if s&1 == 1 { self.node_apply(s, &lazy); s += 1; } if t&1 == 1 { t -= 1; self.node_apply(t, &lazy); } s >>= 1; t >>= 1; } for i in 1..self.depth { if ((l >> i) << i) != l { self.update(l >> i); } if ((r >> i) << i) != r { self.update(r-1 >> i); } } } pub fn max_right(&mut self, l: usize, r_max: usize, f: impl Fn(&Op::Value) -> bool) -> usize { assert!(l <= self.len()); if l == self.len() { return self.len().min(r_max); } let (mut r, mut val) = (l + self.len(), Op::id_value()); for i in (1..self.depth).rev() { self.push(r >> i); } loop { while r&1 == 0 { r >>= 1; } let tmp = Op::prod_value(&val, &self.tree[r]); if !f(&tmp) { break; } val = tmp; r += 1; if r & r-1 == 0 { return self.len().min(r_max); } } while r < self.len() { self.push(r); r *= 2; let tmp = Op::prod_value(&val, &self.tree[r]); if f(&tmp) { val = tmp; r += 1; } } (r - self.len()).min(r_max) } pub fn min_left(&mut self, r: usize, f: impl Fn(&Op::Value) -> bool) -> usize { assert!(r <= self.len()); if r == 0 { return 0; } let (mut l, mut val) = (r + self.len(), Op::id_value()); for i in (1..self.depth).rev() { self.push(l-1 >> i); } loop { l -= 1; while l != 1 && l&1 == 1 { l >>= 1; } let tmp = Op::prod_value(&self.tree[l], &val); if !f(&tmp) { break; } val = tmp; if l & l-1 == 0 { return 0; } } while l < self.len() { self.push(l); l = 2*l + 1; let tmp = Op::prod_value(&self.tree[l], &val); if f(&tmp) { val = tmp; l -= 1; } } l+1 - self.len() } fn node_apply(&mut self, i: usize, lazy: &Op::Lazy) { if Op::BEATS { self.comp_lazy(i, lazy); if !Op::act_value(&mut self.tree[i], lazy) { self.push(i); self.update(i); } } else { Op::act_value(&mut self.tree[i], lazy); self.comp_lazy(i, lazy); } } fn push(&mut self, i: usize) { debug_assert!(i < self.len()); let Some(lazy) = replace(&mut self.lazy[i], None) else { return }; self.node_apply(2*i, &lazy); self.node_apply(2*i+1, &lazy); } fn update(&mut self, i: usize) { debug_assert!(i < self.len()); debug_assert!(self.lazy[i].is_none()); self.tree[i] = Op::prod_value(&self.tree[2*i], &self.tree[2*i+1]); } fn comp_lazy(&mut self, i: usize, ad: &Op::Lazy) { if let Some(lazy) = &mut self.lazy[i] { Op::prod_lazy(lazy, ad); } else { self.lazy[i] = Some(ad.clone()); } } } impl<Op: SegtreeOp> Clone for Segtree<Op> { fn clone(&self) -> Self { Self { tree: self.tree.clone(), lazy: self.lazy.clone(), depth: self.depth.clone() } } } impl<Op: SegtreeOp> Debug for Segtree<Op> where Op::Value: Debug { fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { let mut seg = self.clone(); for i in 1..seg.len() { seg.push(i); } write!(f, "{:?}", &seg.tree[self.len()..]) } } impl<Op: SegtreeOp> FromIterator<Op::Value> for Segtree<Op> { fn from_iter<T: IntoIterator<Item = Op::Value>>(iter: T) -> Self { let v = iter.into_iter().collect::<Vec<_>>(); let mut seg = Self::new(v.len()); let len = seg.len(); for (i, v) in v.into_iter().enumerate() { seg.tree[len+i] = v; } for i in (1..seg.len()).rev() { seg.update(i); } seg } } impl<Op: SegtreeOp, I: SliceIndex<[Op::Value]>> Index<I> for Segtree<Op> { type Output = I::Output; fn index(&self, index: I) -> &Self::Output { Index::index(&self.tree[self.len()..], index) } } impl<Op: SegtreeOp, I: SliceIndex<[Op::Value]>> IndexMut<I> for Segtree<Op> { fn index_mut(&mut self, index: I) -> &mut Self::Output { let len = self.len(); IndexMut::index_mut(&mut self.tree[len..], index) } } } pub mod csr { use std::ops::Index; #[derive(Debug)] pub struct CSR { dat: Vec<usize>, idx: Vec<usize>, } impl CSR { pub fn new(len: usize, dat: &[(usize, usize)]) -> Self { let mut idx = vec![0; len+1]; for &(i, _) in dat { if i+2 <= len { idx[i+2] += 1; } } for i in 0..len { idx[i+1] += idx[i]; } let mut res = vec![0; dat.len()]; for &(i, v) in dat { res[idx[i+1]] = v; idx[i+1] += 1; } Self { dat: res, idx } } pub fn new_undirected(len: usize, dat: &[(usize, usize)]) -> Self { let mut edges = vec![]; for &(i, j) in dat { edges.push((i, j)); edges.push((j, i)); } Self::new(len, &edges) } pub fn from_iter(len: usize, iter: impl IntoIterator<Item = (usize, usize)>) -> Self { let v = iter.into_iter().collect::<Vec<_>>(); Self::new(len, &v) } pub fn from_iter_undirected(len: usize, iter: impl IntoIterator<Item = (usize, usize)>) -> Self { let mut v = iter.into_iter().collect::<Vec<_>>(); for i in 0..v.len() { v.push((v[i].1, v[i].0)); } Self::new(len, &v) } pub fn edge_len(&self) -> usize { self.dat.len() } pub fn len(&self) -> usize { self.idx.len()-1 } pub fn sort(&mut self) { for i in 0..self.len() { self.dat[self.idx[i]..self.idx[i+1]].sort_unstable(); } } pub fn contains(&self, u: usize, v: usize) -> bool { debug_assert!(self[u].is_sorted()); self[u].binary_search(&v).is_ok() } } impl Index<usize> for CSR { type Output = [usize]; fn index(&self, i: usize) -> &Self::Output { &self.dat[self.idx[i]..self.idx[i+1]] } } impl<'a> IntoIterator for &'a CSR { type Item = (usize, usize); type IntoIter = Iter<'a>; fn into_iter(self) -> Self::IntoIter { Iter { src: self, cur: 0, i: 0 } } } pub struct Iter<'a> { src: &'a CSR, cur: usize, i: usize } impl<'a> Iterator for Iter<'a> { type Item = (usize, usize); fn next(&mut self) -> Option<Self::Item> { let mut res = None; if self.cur < self.src.dat.len() { while self.src.idx[self.i+1] == self.cur { self.i += 1; } res = Some((self.i, self.src.dat[self.cur])); } self.cur += 1; res } } } } pub mod algo { pub mod func { pub fn next_permutation<T: Ord>(v: &mut [T]) -> bool { let Some(i) = v.windows(2).rposition(|w| w[0] < w[1]) else { return false; }; let j = v.iter().rposition(|e| e > &v[i]).unwrap(); v.swap(i, j); v[i+1..].reverse(); true } pub fn prev_permutation<T: Ord>(v: &mut [T]) -> bool { let Some(i) = v.windows(2).rposition(|w| w[0] > w[1]) else { return false; }; let j = v.iter().rposition(|e| e < &v[i]).unwrap(); v.swap(i, j); v[i+1..].reverse(); true } pub fn run_length<T: Eq>(iter: impl IntoIterator<Item = T>) -> Vec<(T, usize)> { let mut res = vec![]; for t in iter { let Some(l) = res.last_mut() else { res.push((t, 1)); continue; }; if t == l.0 { l.1 += 1; } else { res.push((t, 1)); } } res } pub fn coalesce_inplace<T>(v: &mut Vec<T>, f: impl Fn(&mut T, &mut T) -> bool) { let mut l = 0; for r in 1..v.len() { unsafe { let [ref_l, ref_r] = v.get_disjoint_unchecked_mut([l, r]); if !f(ref_l, ref_r) { v.swap(l+1, r); l += 1; } } } v.truncate(l+1); } pub fn prefix_fold<T, U>(init: T, iter: impl IntoIterator<Item = U>, mut f: impl FnMut(&T, U) -> T) -> Vec<T> { let mut res = vec![init]; for u in iter { res.push(f(res.last().unwrap(), u)); } res } pub fn suffix_fold<T, U>(init: T, iter: impl Iterator<Item = U> + DoubleEndedIterator, mut f: impl FnMut(&T, U) -> T) -> Vec<T> { let mut res = vec![init]; for u in iter.rev() { res.push(f(res.last().unwrap(), u)); } res.reverse(); res } pub fn binary_search(low: usize, high: usize) -> Option<usize> { if 1 < high.wrapping_sub(low) { Some(high.wrapping_add(low)/2) } else { None } } } } pub mod graph { pub mod tree { #![allow(dead_code)] pub use crate::cplib::ds::csr::CSR; use crate::cplib::ds::segtree::{Segtree, SegtreeOp}; use std::cell::UnsafeCell; const MASK: usize = (1<<32)-1; pub struct Tree<'a> { edge: &'a CSR, root: usize, par: Vec<usize>, depth: Vec<usize>, lca: UnsafeCell<Segtree<LCA>>, euler: Vec<usize>, euler_inv: Vec<usize>, } impl<'a> Tree<'a> { pub fn new(edge: &'a CSR, root: usize) -> Self { let n = edge.len(); let mut par = vec![root; n]; let mut euler = vec![0; n*2]; let mut euler_inv = vec![]; let mut lca = vec![]; let mut depth = vec![0; n]; let mut dfs = vec![root+n, root]; assert!(edge.edge_len() == (n-1)*2); while let Some(i) = dfs.pop() { euler[i] = euler_inv.len(); euler_inv.push(i); if i < n { lca.push((depth[i]+1<<32)+i); for &j in edge[i].iter().rev() { if par[i] != j { par[j] = i; depth[j] = depth[i]+1; dfs.push(j+n); dfs.push(j); } } } else { lca.push((depth[i-n]<<32)+par[i-n]); } } par[root] = !0; Self { edge, root, par, depth, lca: UnsafeCell::new(Segtree::from_iter(lca)), euler, euler_inv } } fn len(&self) -> usize { self.edge.len() } pub fn par(&self, i: usize) -> usize { self.par[i] } pub fn depth(&self, i: usize) -> usize { self.depth[i] } pub fn lca(&self, u: usize, v: usize) -> usize { let (eu, ev) = crate::minmax!(self.euler[u], self.euler[v]); unsafe{&mut *self.lca.get()}.fold(eu..=ev) & MASK } pub fn kth_ancestor(&self, u: usize, k: usize) -> Option<usize> { let n = self.len(); let r = unsafe{&mut *self.lca.get()}.max_right(self.euler[u], 2*n, |&(mut v)| { v &= MASK; v < 2*n && self.depth[u] <= self.depth[v]+k }); if r == 2*n+1 { None } else { Some(self.euler_inv[r-1]-n) } } pub fn dist(&self, u: usize, v: usize) -> usize { let p = self.lca(u, v); self.depth[u] + self.depth[v] - 2*self.depth[p] } pub fn order(&self) -> &[usize] { &self.euler_inv } pub fn depth_max(&self) -> (usize, usize) { (0..self.edge.len()).map(|i| (self.depth[i], i)).max().unwrap() } } struct LCA; impl SegtreeOp for LCA { type Value = usize; type Lazy = (); fn id_value() -> Self::Value { !0 } fn prod_value(lhs: &Self::Value, rhs: &Self::Value) -> Self::Value { *lhs.min(rhs) } } } } pub mod math { pub mod func { pub fn gcd(mut a: usize, mut b: usize) -> usize { while b != 0 { (a, b) = (b, a%b); } a } pub fn lcm(a: usize, b: usize) -> Option<usize> { (a/gcd(a, b)).checked_mul(b) } pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) { let (mut p0, mut q0, mut r0, mut p1, mut q1, mut r1) = (a.signum(), 0, a.abs(), 0, b.signum(), b.abs()); while r1 != 0 { let t = r0/r1; (p0, q0, r0, p1, q1, r1) = (p1, q1, r1, p0 - t*p1, q0 - t*q1, r0 - t*r1); } (p0, q0, r0) } pub fn bezout(a: i64, b: i64, c: i64) -> Option<(i64, i64, i64, i64)> { assert!(b != 0); let (x, y, g) = extgcd(a, b); if c%g != 0 { return None; } let t = (c/g*x).div_euclid(b/g); Some((c/g*x - t*(b/g), c/g*y + t*(a/g), b.abs()/g, -a*b.signum()/g)) } pub fn modinv(x: usize, m: usize) -> Option<usize> { let (y, _, g) = extgcd(x as i64, m as i64); if g == 1 { Some(y.rem_euclid(m as i64) as usize) } else { None } } pub fn mpow(mut x: u128, mut n: u128, m: u128) -> u128 { x %= m; if n == 0 { return if x == 0 || m == 1 {0} else {1}; } n -= 1; let mut res = x; while n != 0 { if n&1 == 1 { res = res*x % m; } x = x*x % m; n >>= 1; } res } pub fn into_ary(mut n: usize, base: usize) -> Vec<usize> { let mut res = vec![]; while n != 0 { res.push(n%base); n /= base; } res } pub fn from_ary(d: &[usize], base: usize) -> usize { let mut res = 0; for &d in d { res = res*base + d; } res } pub fn rational(mut p: i128, mut q: i128) -> (i128, i128) { assert!((p, q) != (0, 0)); if q != 0 { if q < 0 { (p, q) = (-p, -q); } let g = gcd(p.abs() as usize, q.abs() as usize) as i128; (p/g, q/g) } else { (1, 0) } } pub fn into_uv([x, y]: [i128; 2], p: i128, q: i128) -> [i128; 2] { [q*x+p*y, q*y-p*x] } pub fn divisors(pe: &[(usize, usize)]) -> Vec<usize> { let mut res = vec![1]; for &(p, e) in pe.into_iter() { for i in 0..res.len() { let mut k = res[i]; for _ in 0..e { k *= p; res.push(k); } } } res } } pub mod lpf_sieve { pub use crate::cplib::math::func::divisors; use std::ops::{Add, Sub}; const MASK_29BIT: usize = (1<<29)-1; pub struct LpfSieve { primes: Vec<usize>, table: Vec<usize>, } impl LpfSieve { pub fn new(mut max: usize) -> Self { assert!(max <= 1e7 as usize); max = max.max(10); let mut primes = vec![]; let mut table = vec![0; max+1]; for i in 2..=max { if table[i] == 0 { primes.push(i); table[i] = (1 << 58) + (i << 29) + 1; } let lpf_i = (table[i] >> 29) & MASK_29BIT; for &p in &primes { if !(p <= lpf_i && i*p <= max) { break; } table[p*i] = if p == lpf_i { table[i] + (1 << 58) } else { (1 << 58) + (p << 29) + i }; } } Self { primes, table } } pub fn max(&self) -> usize { self.table.len()-1 } pub fn primes(&self) -> &[usize] { &self.primes } pub fn is_prime(&self, n: usize) -> bool { (self.table[n] >> 29) & MASK_29BIT == n } fn data(&self, n: usize) -> (usize, usize, usize) { debug_assert!(2 <= n); ((self.table[n] >> 29) & MASK_29BIT, self.table[n] >> 58, self.table[n] & MASK_29BIT) } pub fn fold<T>(&self, mut n: usize, mut init: T, mut f: impl FnMut(&mut T, usize, usize)) -> T { assert!(n != 0); while n != 1 { let (lpf, exp, nx) = self.data(n); f(&mut init, lpf, exp); n = nx; } init } pub fn factorize(&self, mut n: usize) -> Vec<(usize, usize)> { assert!(1 <= n && n <= self.max().pow(2)); if n <= self.max() { self.fold(n, vec![], |v, p, e| { v.push((p, e)); }) } else { let mut res = vec![]; for &p in &self.primes { let mut cnt = 0; while n%p == 0 { cnt += 1; n /= p; } if cnt != 0 { res.push((p, cnt)); } if n < p*p { break; } } if n != 1 { res.push((n, 1)); } res } } pub fn mobius_point(&self, n: usize) -> i64 { self.fold(n, 1, |v, _p, e| { *v = if e == 1 { -*v } else { 0 }; }) } pub fn mobius(&self, n: usize) -> Vec<i64> { let mut res = vec![0; n+1]; res[1] = 1; for i in 2..=n { let (_lpf, exp, nx) = self.data(i); if exp == 1 { res[i] = -res[nx]; } } res } pub fn div_zeta<T: Copy + Add<Output = T>>(&self, mut f: Vec<T>) -> Vec<T> { let vl = f.len()-1; for &p in self.primes() { if vl < p { break; } for i in 1..=vl/p { f[i*p] = f[i*p] + f[i]; } } f } pub fn div_mobius<T: Copy + Sub<Output = T>>(&self, mut g: Vec<T>) -> Vec<T> { let vl = g.len()-1; for &p in self.primes() { if vl < p { break; } for i in (1..=vl/p).rev() { g[i*p] = g[i*p] - g[i]; } } g } pub fn mul_zeta<T: Copy + Add<Output = T>>(&self, mut f: Vec<T>) -> Vec<T> { let vl = f.len() - 1; for &p in self.primes() { if vl < p { break; } for i in (1..=vl/p).rev() { f[i] = f[i] + f[i*p]; } } f } pub fn mul_mobius<T: Copy + Sub<Output = T>>(&self, mut g: Vec<T>) -> Vec<T> { let vl = g.len() - 1; for &p in self.primes() { if vl < p { break; } for i in 1..=vl/p { g[i] = g[i] - g[i*p]; } } g } } } pub mod modtable { static mut P: usize = 0; static mut INV: Vec<usize> = vec![]; static mut F: Vec<usize> = vec![]; static mut FINV: Vec<usize> = vec![]; pub const O: _O = _O; pub struct _O; #[allow(non_snake_case, static_mut_refs)] impl _O { pub fn init(&self, p: usize, max: usize) { let (mut inv, mut f, mut finv) = (vec![0; max+1], vec![0; max+1], vec![0; max+1]); inv[1] = 1; for i in 2..=max { inv[i] = p - (p/i * inv[p%i] % p); } f[0] = 1; finv[0] = 1; for i in 1..=max { f[i] = f[i-1]*i % p; finv[i] = finv[i-1]*inv[i] % p; } unsafe { (P, INV, F, FINV) = (p, inv, f, finv); } } pub fn MC<const N: usize>(&self, k: [usize; N]) -> usize { let s = k.iter().sum::<usize>(); unsafe { let mut res = F[s]; for k in k { res = res * FINV[k] % P; } res } } pub fn C(&self, n: usize, k: usize) -> usize { if n < k { 0 } else { unsafe { F[n] * FINV[k] % P * FINV[n-k] % P } } } pub fn P(&self, n: usize, k: usize) -> usize { if n < k { 0 } else { unsafe { F[n] * FINV[n-k] % P } } } pub fn H(&self, n: usize, k: usize) -> usize { assert!(n != 0); self.C(n+k-1, k) } pub fn f(&self, n: usize) -> usize { unsafe { F[n] } } pub fn finv(&self, n: usize) -> usize { unsafe { FINV[n] } } } } } pub mod mod998 { } pub mod util { pub mod output { #![allow(static_mut_refs, non_camel_case_types)] use std::{mem::replace, ops::{Not, Shl}, fmt::Write}; static mut BUFFER: Buffer = Buffer { buf: String::new(), endp: false, prev: Previous::LineHead }; pub struct Buffer { buf: String, endp: bool, prev: Previous, } impl Buffer { fn print(&mut self) { if replace(&mut self.prev, Previous::LineHead) == Previous::LineHead { self.buf.pop(); } if crate::cplib::SUBMISSION { println!("{}", self.buf); } else { eprint!("\x1b[32m"); if self.buf.is_empty() { eprintln!("(empty)"); } else { for s in self.buf.split('\n') { println!("{s}"); } } eprint!("\x1b[0m"); } self.buf.clear(); } fn space(&mut self, sp: bool) { let prev = replace(&mut self.prev, if sp {Previous::Space} else {Previous::NoSpace}); if (sp || prev == Previous::Space) && prev != Previous::LineHead { self.buf.push(' '); } } } #[derive(Clone, Copy)] pub struct out; pub struct out_usp; pub struct end; #[derive(PartialEq, Eq, Clone, Copy)] enum Previous { Space, NoSpace, LineHead, } impl out { pub fn init(endp: bool) { unsafe { BUFFER.buf.reserve(1<<24); BUFFER.endp = endp; } } pub fn print() { unsafe { BUFFER.print(); } } fn push<T: Primitive>(v: &T) { unsafe { BUFFER.space(true); v.fmt(&mut BUFFER.buf); } } pub fn ln() { unsafe { BUFFER.buf.push('\n'); BUFFER.prev = Previous::LineHead; } } } impl out_usp { fn push<T: Primitive>(v: &T) { unsafe { BUFFER.space(false); v.fmt(&mut BUFFER.buf); } } } impl Not for out { type Output = out_usp; fn not(self) -> Self::Output { out_usp } } macro_rules! impl_outs { ($($t:ty),+) => { $( impl<T: Primitive> Shl<T> for $t { type Output = Self; fn shl(self, rhs: T) -> Self::Output { Self::push(&rhs); self } } impl Shl<end> for $t { type Output = Self; fn shl(self, _: end) -> Self::Output { unsafe { if BUFFER.endp { BUFFER.print(); } else { BUFFER.buf += "\n"; BUFFER.prev = Previous::LineHead; } } self } } )+ }; } impl_outs!(out, out_usp); macro_rules! impl_for_slices { ($($t:ty),+) => { $(impl_for_slices!($t; out, out_usp);)+ }; ($t:ty; $($u:ty),+) => { $( impl<T: Primitive> Shl<$t> for $u { type Output = Self; fn shl(self, rhs: $t) -> Self::Output { for v in rhs { Self::push(v); } self } } )+} } impl_for_slices!(&[T], &Vec<T>); trait Primitive { fn fmt(&self, buf: &mut String); } macro_rules! impl_primitive { ($($t:ty),+) => { $( impl Primitive for $t { fn fmt(&self, buf: &mut String) { write!(buf, "{self}").ok(); } } )+ } } impl_primitive!(char, u32, u64, u128, usize, i32, i64, i128, f32, f64, &str, &String, String); impl Primitive for u8 { fn fmt(&self, buf: &mut String) { buf.push(*self as char); } } impl Primitive for bool { fn fmt(&self, buf: &mut String) { *buf += if *self { "Yes" } else { "No" }; } } } pub mod traits { pub trait Grid: Copy + Default { const AROUND: [[i64; 2]; 8] = [[0, -1], [0, 1], [-1, 0], [1, 0], [-1, -1], [-1, 1], [1, -1], [1, 1]]; fn add(self, rhs: [i64; 2]) -> Self; fn add_char(self, c: char, n: i64) -> Self { let mut d = Self::AROUND[match c { 'L' => 2, 'R' => 3, 'U' => 1, 'D' => 0, _ => unreachable!() }]; d[0] *= n; d[1] *= n; self.add(d) } fn around4(self) -> [Self; 4] { let mut res = [Default::default(); 4]; for i in 0..4 { res[i] = self.add(Self::AROUND[i]); } res } fn around8(self) -> [Self; 8] { let mut res = [Default::default(); 8]; for i in 0..8 { res[i] = self.add(Self::AROUND[i]); } res } fn rotate(self, n: usize, t: i64) -> Self; } impl Grid for [usize; 2] { fn add(mut self, rhs: [i64; 2]) -> Self { for i in 0..2 { self[i] = self[i].wrapping_add_signed(rhs[i] as isize); } self } fn rotate(self, n: usize, t: i64) -> Self { let [i, j] = self; match t.rem_euclid(4) { 0 => [i, j], 1 => [j, n-1-i], 2 => [n-1-i, n-1-j], 3 => [n-1-j, i], _ => unreachable!() } } } impl Grid for [i64; 2] { fn add(mut self, rhs: [i64; 2]) -> Self { for i in 0..2 { self[i] += rhs[i]; } self } fn rotate(self, _: usize, _: i64) -> Self { unimplemented!() } } pub trait CharUtil: Clone { const LOWER: [Self; 26]; const UPPER: [Self; 26]; const NUMBER: [Self; 10]; fn us(self) -> usize; fn parse_lower(self) -> usize; fn parse_upper(self) -> usize; fn parse_digit(self) -> usize; fn flip(self) -> Self; } impl CharUtil for char { const LOWER: [char; 26] = { let (mut out, mut i) = (['_'; 26], 0); while i < 26 { out[i] = (i+97) as u8 as char; i += 1; } out }; const UPPER: [char; 26] = { let (mut out, mut i) = (['_'; 26], 0); while i < 26 { out[i] = (i+65) as u8 as char; i += 1; } out }; const NUMBER: [char; 10] = { let (mut res, mut i) = (['_'; 10], 0); while i < 10 { res[i] = (i+48) as u8 as char; i += 1; } res }; fn us(self) -> usize { if self <= '9' { self as usize - 48 } else { (self as usize & 31) - 1 } } fn parse_lower(self) -> usize { debug_assert!('a' <= self && self <= 'z'); self as usize - 97 } fn parse_upper(self) -> usize { debug_assert!('A' <= self && self <= 'Z'); self as usize - 65 } fn parse_digit(self) -> usize { debug_assert!('0' <= self && self <= '9'); self as usize - 48 } fn flip(self) -> Self { (self as u8 ^ 32) as char } } use std::collections::{BTreeMap, HashMap}; use std::hash::Hash; pub trait MapInit { type K; type V; fn init(&mut self, key: Self::K, init: Self::V) -> &mut Self::V; fn init_with(&mut self, key: Self::K, init: impl FnOnce() -> Self::V) -> &mut Self::V; } impl<K: Eq + Hash, V> MapInit for HashMap<K, V> { type K = K; type V = V; fn init(&mut self, key: K, init: V) -> &mut V { self.entry(key).or_insert(init) } fn init_with(&mut self, key: K, init: impl FnOnce() -> Self::V) -> &mut V { self.entry(key).or_insert_with(init) } } impl<K: Ord, V> MapInit for BTreeMap<K, V> { type K = K; type V = V; fn init(&mut self, key: K, init: V) -> &mut V { self.entry(key).or_insert(init) } fn init_with(&mut self, key: Self::K, init: impl FnOnce() -> Self::V) -> &mut Self::V { self.entry(key).or_insert_with(init) } } pub trait VecSplit { type Output; fn split(self) -> Self::Output; } impl<T0, T1> VecSplit for Vec<(T0, T1)> { type Output = (Vec<T0>, Vec<T1>); fn split(self) -> Self::Output { let mut res = (vec![], vec![]); for e in self { res.0.push(e.0); res.1.push(e.1); } res } } impl<T0, T1, T2> VecSplit for Vec<(T0, T1, T2)> { type Output = (Vec<T0>, Vec<T1>, Vec<T2>); fn split(self) -> Self::Output { let mut res = (vec![], vec![], vec![]); for e in self { res.0.push(e.0); res.1.push(e.1); res.2.push(e.2); } res } } } pub mod macros { #[macro_export] macro_rules! nest { [void; $n:expr] => { std::vec![std::vec![]; $n] }; [void; $n:expr $(;$m:expr)+] => { std::vec![crate::nest![void$(;$m)+]; $n] }; [$($v:expr),*] => { std::vec![$($v),*] }; [$e:expr; $n:expr] => { std::vec![$e; $n] }; [$e:expr; $n:expr $(;$m:expr)+] => { std::vec![crate::nest![$e$(;$m)+]; $n] }; } #[macro_export] macro_rules! iota { ($range:expr) => { ($range).collect::<Vec<_>>() }; ($range:expr, $($f:tt)*) => { ($range).map($($f)*).collect::<Vec<_>>() }; } #[macro_export] macro_rules! min { ($($vl:expr),+) => { [$($vl),+].into_iter().reduce(|x,y| if x <= y {x} else {y}).unwrap() } } #[macro_export] macro_rules! max { ($($vl:expr),+) => { [$($vl),+].into_iter().reduce(|x,y| if x >= y {x} else {y}).unwrap() } } #[macro_export] macro_rules! minmax { ($v:expr, $w:expr) => {{ let (v, w) = ($v, $w); if v <= w { (v, w) } else { (w, v) } }}; ($($vl:expr),+) => {{ let l = [$($vl),+]; (l.iter().reduce(|x,y| if x <= y {x} else {y}).unwrap().clone(), l.iter().reduce(|x,y| if x >= y {x} else {y}).unwrap().clone()) }} } #[macro_export] macro_rules! chmin { ($dst:expr; $v:expr) => { { let v = $v; if v < $dst { $dst = v; true } else { false } } }; ($dst:expr; $($vl:expr),+) => { crate::chmin!($dst; crate::min!($($vl),+)) } } #[macro_export] macro_rules! chmax { ($dst:expr; $v:expr) => { { let v = $v; if $dst < v { $dst = v; true } else { false } } }; ($dst:expr; $($vl:expr),+) => { crate::chmax!($dst; crate::max!($($vl),+)) } } #[macro_export] macro_rules! swap { ($l:expr, $r:expr) => { ($l, $r) = ($r, $l); }; } #[macro_export] macro_rules! prefix { ($v:expr) => { { let mut res = vec![0]; for x in $v.into_iter() { res.push(res.last().unwrap()+x); } res } }; } #[macro_export] macro_rules! vadd { ($v:expr, -$x:expr) => {{ let x = $x; for e in &mut $v { *e -= x; } }}; ($v:expr, $x:expr) => {{ let x = $x; for e in &mut $v { *e += x; } }} } } pub mod func { use std::ops::{RangeBounds, Bound}; pub fn to_bounds(range: impl RangeBounds<usize>, sup: usize) -> [usize; 2] { let l = match range.start_bound() { Bound::Included(&v) => v, Bound::Excluded(&v) => v+1, Bound::Unbounded => 0 }; let r = match range.end_bound() { Bound::Included(&v) => v+1, Bound::Excluded(&v) => v, Bound::Unbounded => sup }.min(sup); if l >= r { [0, 0] } else { [l, r] } } } pub mod debug { pub fn replace_inf_and_truncate(mut s: String) -> String { let (mut res, mut stk) = (String::new(), String::new()); s.push('*'); for c in s.chars() { if c.is_numeric() || c == '.' { stk.push(c); continue; } if stk.parse::<f64>().map_or(false, |s| 1.15e18 <= s) { res += "inf"; } else { res += &stk; } stk.clear(); res.push(c); } res.pop(); if res.len() >= 500 { res.truncate(500); res += "<skipped>"; } res } pub fn epr_table<T: std::fmt::Debug>(src: &Vec<Vec<T>>, mut imax: usize, mut jmax: usize) { if crate::cplib::SUBMISSION { return; } use std::fmt::Write; let (mut lmax, mut res) = (2, String::from(" ")); imax = imax.min(src.len()); if 0 < imax { jmax = jmax.min(src[0].len()).min(100); } let tmp: Vec<Vec<String>> = (0..imax).map(|i| (0..jmax).map(|j| { let s = if let Some(x) = src[i].get(j) { replace_inf_and_truncate(format!("{x:?}")) } else { "--".into() }; lmax = lmax.max(s.len()); s }).collect()).collect(); for i in 0..jmax { write!(&mut res, "{i: >lmax$} ").unwrap(); } res += "\n"; for i in 0..imax { write!(&mut res, "{i: >2}: [").unwrap(); for s in &tmp[i][..jmax] { write!(&mut res, "{s: >lmax$}, ").unwrap(); } res.pop(); res.pop(); res += "]\n"; } eprintln!("\x1b[38;5;208m--- start epr_table ---\n{res}--- end epr_table ---\n\x1b[0m"); } #[macro_export] macro_rules! epr { ($($args:tt)*) => { if !$crate::SUBMISSION { eprintln!("\x1b[31m{}\x1b[0m", crate::util::debug::replace_inf_and_truncate(format!($($args)*))); } } } #[macro_export] macro_rules! oj_local { ($oj:expr, $local:expr) => { if $crate::SUBMISSION { $oj } else { $local } }; } } } }