結果
問題 | No.2526 Kth Not-divisible Number |
ユーザー | haihamabossu |
提出日時 | 2023-11-03 21:41:59 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 289 ms / 2,000 ms |
コード長 | 2,453 bytes |
コンパイル時間 | 2,086 ms |
コンパイル使用メモリ | 180,132 KB |
実行使用メモリ | 4,348 KB |
最終ジャッジ日時 | 2023-11-03 21:42:11 |
合計ジャッジ時間 | 5,560 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 288 ms
4,348 KB |
testcase_04 | AC | 289 ms
4,348 KB |
testcase_05 | AC | 289 ms
4,348 KB |
testcase_06 | AC | 287 ms
4,348 KB |
testcase_07 | AC | 288 ms
4,348 KB |
testcase_08 | AC | 269 ms
4,348 KB |
testcase_09 | AC | 232 ms
4,348 KB |
testcase_10 | AC | 266 ms
4,348 KB |
testcase_11 | AC | 165 ms
4,348 KB |
ソースコード
pub mod binary_search { type T = usize; pub fn binary_search(mut ok: T, mut ng: T, f: impl Fn(T) -> bool) -> T { let cont = |ok: T, ng: T| { let l = ok.min(ng); let r = ok.max(ng); l + 1 < r }; while cont(ok, ng) { let x = (ok + ng) / 2; if f(x) { ok = x; } else { ng = x; } } ok } } pub mod gcd_lcm { pub fn gcd(a: usize, b: usize) -> usize { if b == 0 { a } else { gcd(b, a % b) } } pub fn lcm(a: usize, b: usize) -> usize { let g = gcd(a, b); a / g * b } } pub mod scanner { pub struct Scanner { buf: Vec<String>, } impl Scanner { pub fn new() -> Self { Self { buf: vec![] } } pub fn new_from(source: &str) -> Self { let source = String::from(source); let buf = Self::split(source); Self { buf } } pub fn next<T: std::str::FromStr>(&mut self) -> T { loop { if let Some(x) = self.buf.pop() { return x.parse().ok().expect(""); } let mut source = String::new(); std::io::stdin().read_line(&mut source).expect(""); self.buf = Self::split(source); } } fn split(source: String) -> Vec<String> { source .split_whitespace() .rev() .map(String::from) .collect::<Vec<_>>() } } } use crate::{binary_search::binary_search, gcd_lcm::lcm, scanner::Scanner}; use std::io::Write; fn main() { let mut scanner = Scanner::new(); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); let t: usize = scanner.next(); for _ in 0..t { solve(&mut scanner, &mut out); } } fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) { let a = scanner.next::<usize>(); let b = scanner.next::<usize>(); let k = scanner.next::<usize>(); let l = lcm(a, b); let ans = binary_search(4e18 as usize, 0 as usize, |x| { let mut count = 0; count += x / a; count += x / b; count -= x / l; k <= x - count }); writeln!(out, "{}", ans).unwrap(); }