Submission #19217158


Source Code Expand

// use rand::distributions::Uniform;
// use rand::{thread_rng, Rng};
use std::cmp::max;

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());

    // for n in 1..=100 {
    //     for m in 1..=n {
    //         let sum = n * (n + 1) / 2;
    //         let x = sum - m;
    //         let y = n;
    //         let g = gcd(x, y);
    //         let (x, y) = (x / g, y / g);
    //         let ans = solve(x, y);
    //         assert!(ans.is_some(), "x/y = {}/{} n={} m={}", x, y, n, m);
    //         let (an, am) = solve(x, y).unwrap();
    //         if an != n || am != m {
    //             println!("x/y = {}/{} n={} m={} ans={:?}", x, y, n, m, (an, am));
    //         }
    //         // println!("{}/{}", x, y);
    //     }
    // }

    // let mut rng = thread_rng();
    // loop {
    //     let n = rng.sample(Uniform::from(1..=(1e9 as i128)));
    //     let m = rng.sample(Uniform::from(1..=n));
    //     let sum = n * (n + 1) / 2;
    //     let x = sum - m;
    //     let y = n;
    //     let g = gcd(x, y);
    //     let (x, y) = (x / g, y / g);
    //     let ans = solve(x, y);
    //     assert!(ans.is_some(), "x/y = {}/{} n={} m={}", x, y, n, m);
    //     let (an, am) = solve(x, y).unwrap();
    //     assert!(an == n && am == m, "{}/{}", x, y);
    //     println!("{}/{}", x, y);
    // }

    let s: String = sc.read();
    let mut iter = s.split('/');
    let x = iter.next().unwrap().parse::<i128>().unwrap();
    let y = iter.next().unwrap().parse::<i128>().unwrap();
    let g = gcd(x, y);
    let x = x / g;
    let y = y / g;

    let n = (2 * x) / y;

    let mut ans = vec![];
    for n in max(1, n - 100)..=max(2, n + 100) {
        if let Some(m) = solve_m(n, x, y) {
            ans.push((n, m));
        }
    }

    if ans.is_empty() {
        println!("Impossible");
    } else {
        for (n, m) in ans {
            println!("{} {}", n, m)
        }
    }
}

fn solve(x: i128, y: i128) -> Option<(i128, i128)> {
    let g = gcd(x, y);
    let x = x / g;
    let y = y / g;

    let n = (2 * x) / y;

    for n in max(1, n - 3)..=max(2, n + 4) {
        if let Some(m) = solve_m(n, x, y) {
            return Some((n, m));
        }
    }
    None
}

fn solve_m(n: i128, x: i128, y: i128) -> Option<i128> {
    if (x * n) % y != 0 {
        return None;
    }

    let sum = n * (n + 1) / 2;
    let m = sum - (x * n) / y;
    if m <= 0 || n < m {
        return None;
    }

    let cxn = (sum - m) * y;
    if cxn % n != 0 {
        return None;
    }
    let cx = cxn / n;
    if cx != x {
        return None;
    }

    return Some(m);
}

fn gcd(x: i128, y: i128) -> i128 {
    if y == 0 {
        x
    } else {
        gcd(y, x % y)
    }
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        Self(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write_all(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}

Submission Info

Submission Time
Task C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi )
User kenkoooo
Language Rust (1.42.0)
Score 100
Code Size 4011 Byte
Status AC
Exec Time 7 ms
Memory 2136 KiB

Compile Error

warning: function is never used: `solve`
  --> src/main.rs:68:4
   |
68 | fn solve(x: i128, y: i128) -> Option<(i128, i128)> {
   |    ^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 60
Set Name Test Cases
All 00_killer.txt, 00_max.txt, 00_min.txt, 00_min2.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 03_smallrnd_00.txt, 03_smallrnd_01.txt, 03_smallrnd_02.txt, 03_smallrnd_03.txt, 03_smallrnd_04.txt, 03_smallrnd_05.txt, 03_smallrnd_06.txt, 03_smallrnd_07.txt, 03_smallrnd_08.txt, 03_smallrnd_09.txt, 04_primes_01.txt, 04_primes_02.txt
Case Name Status Exec Time Memory
00_killer.txt AC 7 ms 2036 KiB
00_max.txt AC 1 ms 2064 KiB
00_min.txt AC 1 ms 1956 KiB
00_min2.txt AC 1 ms 2036 KiB
00_sample_01.txt AC 1 ms 2088 KiB
00_sample_02.txt AC 1 ms 2016 KiB
00_sample_03.txt AC 1 ms 2132 KiB
00_sample_04.txt AC 2 ms 1996 KiB
01_rnd_00.txt AC 2 ms 2012 KiB
01_rnd_01.txt AC 1 ms 2008 KiB
01_rnd_02.txt AC 3 ms 2060 KiB
01_rnd_03.txt AC 2 ms 2136 KiB
01_rnd_04.txt AC 3 ms 2044 KiB
01_rnd_05.txt AC 2 ms 1980 KiB
01_rnd_06.txt AC 2 ms 1932 KiB
01_rnd_07.txt AC 1 ms 2080 KiB
01_rnd_08.txt AC 2 ms 1948 KiB
01_rnd_09.txt AC 1 ms 1972 KiB
01_rnd_10.txt AC 2 ms 2112 KiB
01_rnd_11.txt AC 4 ms 2056 KiB
01_rnd_12.txt AC 2 ms 2060 KiB
01_rnd_13.txt AC 2 ms 2088 KiB
01_rnd_14.txt AC 2 ms 2068 KiB
01_rnd_15.txt AC 2 ms 1956 KiB
01_rnd_16.txt AC 2 ms 2044 KiB
01_rnd_17.txt AC 2 ms 2024 KiB
01_rnd_18.txt AC 2 ms 2088 KiB
01_rnd_19.txt AC 1 ms 2056 KiB
02_rnd2_00.txt AC 2 ms 2016 KiB
02_rnd2_01.txt AC 2 ms 2104 KiB
02_rnd2_02.txt AC 1 ms 2020 KiB
02_rnd2_03.txt AC 2 ms 2076 KiB
02_rnd2_04.txt AC 3 ms 2136 KiB
02_rnd2_05.txt AC 1 ms 2048 KiB
02_rnd2_06.txt AC 2 ms 2064 KiB
02_rnd2_07.txt AC 1 ms 2096 KiB
02_rnd2_08.txt AC 2 ms 2056 KiB
02_rnd2_09.txt AC 1 ms 1980 KiB
02_rnd2_10.txt AC 2 ms 1952 KiB
02_rnd2_11.txt AC 1 ms 1988 KiB
02_rnd2_12.txt AC 2 ms 2020 KiB
02_rnd2_13.txt AC 2 ms 2112 KiB
02_rnd2_14.txt AC 2 ms 2048 KiB
02_rnd2_15.txt AC 2 ms 2112 KiB
02_rnd2_16.txt AC 1 ms 2072 KiB
02_rnd2_17.txt AC 2 ms 2092 KiB
02_rnd2_18.txt AC 2 ms 2020 KiB
02_rnd2_19.txt AC 2 ms 2024 KiB
03_smallrnd_00.txt AC 1 ms 1984 KiB
03_smallrnd_01.txt AC 1 ms 1956 KiB
03_smallrnd_02.txt AC 2 ms 2080 KiB
03_smallrnd_03.txt AC 2 ms 2004 KiB
03_smallrnd_04.txt AC 2 ms 2036 KiB
03_smallrnd_05.txt AC 2 ms 2004 KiB
03_smallrnd_06.txt AC 2 ms 2056 KiB
03_smallrnd_07.txt AC 2 ms 2132 KiB
03_smallrnd_08.txt AC 2 ms 2092 KiB
03_smallrnd_09.txt AC 1 ms 2012 KiB
04_primes_01.txt AC 1 ms 2008 KiB
04_primes_02.txt AC 2 ms 1932 KiB