Problem:
Score : 300 points

Problem Statement

You are given an integer N.

Find a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.

If there are multiple solutions, any of them will be accepted.

Constraints

It is guaranteed that, for the given integer N, there exists a solution such that h,n,w \leq 3500.

Inputs

Input is given from Standard Input in the following format:

N

Outputs

Print a triple of positive integers h, n and w that satisfies the condition, in the following format:

h n w

Sample Input 1

2

Sample Output 1

1 2 2

4/2 = 1/1 + 1/2 + 1/2.

Sample Input 2

3485

Sample Output 2

872 1012974 1539173474040

It is allowed to use an integer exceeding 3500 in a solution.

Sample Input 3

4664

Sample Output 3

3498 3498 3498

Solution in Rust (1.15.1) (judge verdict: Runtime Error)

use std::io::stdin;

/**
 * C
 */
fn main() {
    let n: i64 = {
        let mut  s = String::new();
        stdin().read_line(&mut s).unwrap();
        s.trim_right().parse().unwrap()
    };
    let (mut h, mut w,mut l) = (0, 0, 0);

    if n % 2 == 0 { // nが偶数
        h = n / 2;
        w = n;
        l = n;
    } else { // nが奇数
        let (_w,cnt) = {
            let mut cnt = 1;
            loop {
                let mut w = (n + cnt) / 4;
                // wが整数 かつ wがx-iの倍数
                if (n+cnt) % 4 == 0 && w % (cnt-1) == 0 {
                    break;
                }
                cnt+=1;
            }
            ((n + cnt) / 4, cnt)
        };
        w = _w;
        h = n*w;
        l = n*(w/(cnt-1));

    }

    println!("{} {} {}", h, w, l)
}