#712378 (Rust) No.1626 三角形の構築

• 問題: No.1626 三角形の構築
• ユーザー: koba-e964
• 提出日時: 2021-11-02 19:46:57
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 194 ms / 2,000 ms
• コード長: 2,662 bytes
• コンパイル時間: 14,590 ms
• コンパイル使用メモリ: 382,732 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-12 12:03:13
• 合計ジャッジ時間: 16,441 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 26

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;
#[allow(dead_code)]
fn getline() -> String {
    let mut ret = String::new();
    std::io::stdin().read_line(&mut ret).ok().unwrap();
    ret
}
fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}
#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }
fn nth(a: i64, n: i64) -> i64 {
    let mut pass = 0;
    let mut fail = std::cmp::min(a, 1 << ((60 + n - 1) / n)) + 1;
    while fail - pass > 1 {
        let mid = (fail + pass) / 2;
        let mut tmp = 1i64;
        for _ in 0..n {
            tmp = tmp.saturating_mul(mid);
        }
        if tmp <= a {
            pass = mid;
        } else {
            fail = mid;
        }
    }
    pass
}
// Solves y = x(a-x) (x>=0)
fn calc(a: i64, y: i64) -> Option<i64> {
    if 4 * y > a * a {
        return None;
    }
    let sd = nth(a * a - 4 * y, 2);
    if sd * sd != a * a - 4 * y {
        return None;
    }
    Some((a - sd) / 2)
}
fn solve(s: i64, t: i64) -> Vec<(i64, i64, i64)> {
    if t % 2 != 0 || 18 * s >= t * t {
        return vec![];
    }
    let t = t / 2;
    if s * s % t != 0 {
        return vec![];
    }
    let q = s * s / t;
    // q = (t-a)(t-b)(a+b-t)
    let mut divs = vec![];
    let mut d = 1;
    while d * d <= q {
        if q % d == 0 {
            divs.push(d);
            if q != d * d {
                divs.push(q / d);
            }
        }
        d += 1;
    }
    let mut ans = vec![];
    for d in divs {
        if d >= t { continue; }
        let a = t - d;
        if let Some(x) = calc(a, q / d) {
            let b = t - x;
            if b < 0 { continue; }
            let mut v = [a, b, 2 * t - a - b];
            v.sort_unstable();
            ans.push((v[0], v[1], v[2]));
        }
    }
    ans.sort_unstable();
    ans.dedup();
    ans
}
fn main() {
    let t: usize = get();
    for _ in 0..t {
        let s: i64 = get();
        let t: i64 = get();
        let v = solve(s, t);
        println!("{}", v.len());
        for (a, b, c) in v {
            println!("{} {} {}", a, b, c);
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX