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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

class Program
{
      public static int CountChar(string s, char c) {
    return s.Length - s.Replace(c.ToString(), "").Length;
  }
	static void Main(string[] args)
	{
        /*
		// 整数の入力
		int a = int.Parse(Console.ReadLine());
		// スペース区切りの整数の入力
		string[] input = Console.ReadLine().Split(' ');
		int b = int.Parse(input[0]);
		int c = int.Parse(input[1]);
		// 文字列の入力
		string s = Console.ReadLine();
		//出力
		Console.WriteLine((a+b+c) + " " + s);
        */

        //System.Console.WriteLine(CountChar(Console.ReadLine(), '1'));

/* 
        int n = int.Parse(Console.ReadLine());
        SortedList<int, int> data = new SortedList<int, int>();
        for (int i = 0; i < n; i++){
            string[] d = Console.ReadLine().Split(' ');
            int r = int.Parse(d[0]);
            int p = int.Parse(d[1]);
            data.Add(r, p);
        }

        var num = 0;
        var index = 0;
        var point = 10000000000;
        KeyValuePair<int, int> pre = new KeyValuePair<int, int>();
        foreach (var d in data)
        {
            num += d.Key - index;
            index = d.Key;
            pre = d;
        }

        Console.WriteLine(num + pre.Value);
        */
        int max = 3500;
        int n= int.Parse(Console.ReadLine());
        for (int i = 1; i <= max; i++){
            for (int j = 1; j <= max; j++){
                /*for (int k = j; k < max; k++){
                    if (4*i*j*k == (i*j + j*k + k*i)*n){
                        System.Console.WriteLine(i + " " + j + " " + k);
                        return;
                    }
                }*/
                int k = (int)(1.0 / (4.0/n - 1.0/i - 1.0/j));
                if (k <= 0) continue;
                if (4*i*j*k == (i*j + j*k + k*i)*n){
                    System.Console.WriteLine(i + " " + j + " " + k);
                    return;
                }
            }
        }
	}
}