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<bits/stdc++.h>
using namespace std;

struct obj{
	long long a, b;
};

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	long long N, K;
	cin >> N >> K;

	int l = 0;
	long long aux = K;
	while(aux) {
		l++;
		aux >>= 1;
	}

	vector<obj> v;
	long long ans1 = 0;
	for(int i = 0; i < N; ++i){
		long long a,b;
		cin >> a >> b;
		int l1 = 0;
		long long aux1 = a;
		while(aux1) {
			l1++;
			aux1 >>= 1;
		}
		v.push_back({a,b});
		if(l1 < l) ans1 += b;
	}
	sort(v.begin(), v.end(), [](obj& a, obj& b) {
		return a.a > b.a;
	});

	long long O = 0;
	long long ans2 = 0;
	for(int i = 0; i < (int)v.size(); ++i){
		if((v[i].a | O) <= K) {
			ans2 += v[i].b;
			O |= v[i].a;
		}
	}
	cout << max(ans1, ans2) << endl;
}