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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
void f(int s, int c, int e) {

}
int main() {
	long long int  N, H, A, W, flag = 0;
	std::cin >> N;
	for (int h = -1500; h <= 2000; h++) {
		for (int n = -1200; n <= 2000; n++) {
			for (int w = 1; w <= 3500; w++)
				if (N*(n*w + h*n + h*w) == (n*h*w)*4 ) {
					H = h, W = w, A = n;
					flag = 1;
					break;
				}
			if (flag == 1)
				break;
		}
		if (flag == 1)
			break;
	}
	std::cout << H <<" "<< W <<" "<< A << std::endl;
	return 0;
}