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 <iomanip>
using namespace std;
int main(void){
    // Here your code !
    int n;
    int i,j,k;
    int max_i,min_k;
    int flag = 0;
    double ans_i, ans_j, ans_k, warun;
    cin >> n;
    warun = 4.0 / n;
    
    if(3 * n % 4 == 0){
        max_i = 3 * n / 4;
        min_k = 3 * n / 4;
    }
    else{
        max_i = 3 * n / 4 + 1;
        min_k = 3 * n / 4;
    }
    for(i = n / 4; i <= max_i ; i++){
        ans_i = 1.0 / i;
        for(j = i; j <= min_k + 1; j++){
            ans_j = 1.0 / j;
            if( ans_i + ans_j + 1.0 / min_k < warun){
                break;
            }
            if(ans_i + ans_j + 1.0 / 3500 > warun){
            }
            else{
                for(k = min_k ; k < 3501; k++){
                    ans_k = 1.0 / k;
                    if( ans_i + ans_j + ans_k < warun){
                    break;
                    }
                    else if( ans_i + ans_j + ans_k == warun){
                    flag = 1;
                    break;
                    }
                }
            }
            if(flag == 1)
                break;
        }
        if(flag == 1){
            cout << i << " "<< j << " " << k << endl;
            break;
        }
    }
    return 0;
}