codeforces #384 Vladik and fractions （构造算法）

Problem:
给定一个n，有三个不超过10^9的x,y,z，使得2/n = 1/x + 1/y + 1/z，后三个数是真分数。
Solution:
将已知数2/n进行分解，n/2 = 1/n + 1/(n+1) + 1/(n*(n+1));

#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set><