传送门：http://codeforces.com/contest/743/problem/C
C. Vladik and fractions
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputVladik 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 
. Because Chloe can't check Vladik's answer if the numbers are large, he asks you to print numbers not exceeding 109.
If there is no such answer, print -1.
Input
The single line contains single integer n (1 ≤ n ≤ 104).
Output
If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 109, 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 #include <iostream> 2 using namespace std; 3 4 int main(){ 5 long long n; 6 cin>>n; 7 if(n==1) 8 cout<<-1<<endl; 9 else 10 cout<<n<<" "<<n+1<<" "<<n*(n+1)<<endl; 11 return 0; 12 }