练习赛12-B Vladik and fractions

题目： Vladik and fractions

问题描述：

Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer n he can represent fraction as a sum of three distinct positive fractions in form .

Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that that 2/n=1/x+1/y+1/z. Because Chloe can’t check Vladik’s answer if the numbers are large, he asks you to print numbers not exceeding 10⁹.

If there is no such answer, print -1.

Input
The single line contains single integer n (1 ≤ n ≤ 10⁴).

Output
If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 10⁹, x ≠ y, x ≠ z, y ≠ z). Otherwise print -1.

If there are multiple answers, print any of them.

Examples
Input
3
Output
2 7 42
Input
7
Output
7 8 56

因为1/n=(1+n)/((1+n)n)，所以1/n=1/(n+1)+1/((n+1)n;
所以2/n=1/(n+1)+1/(n+1)n;
且当n=1时，x=1,y=1,z=1;

#include<iostream>
using namespace std;
int main()
{
	int n;
	cin>>n;
	if(n==1){
	cout<<"-1"<<endl;
	return 0;}
	cout<<n<<" "<<n+1<<" "<<n*(n+1)<<endl;
}
        }

---

、