743C. Vladik and fractions codeforces
2016-12-15 21:19
393 查看
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n==1)
cout<<-1<<endl;
else
cout<<n<<' '<<n+1<<' '<<n*(n+1)<<endl;
return 0;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Codeforces Round #384 (Div. 2) C. Vladik and fractions（构造题）
- Codeforces Round #384 (Div. 2) C. Vladik and fractions（构造题）
- Codeforces Round #416 (Div. 2) B. Vladik and Complicated Book
- Vladik and Memorable Trip CodeForces - 811C DP
- Codeforces 743C-Vladik and fractions（构造）
- 【44.64%】【codeforces 743C】Vladik and fractions
- CodeForces 743C Vladik and fractions (数论)
- Codeforces Round #384 (Div. 2) A. Vladik and flights【思维】水题
- Codeforces Round #416 (Div. 2) C Vladik and Memorable Trip
- 【Codeforces 743C Vladik and fractions】
- Codeforces Round #416 (Div. 2) C - Vladik and Memorable Trip
- E. Vladik and cards Codeforces Round #384 (Div. 2) 好题 二分+(贪心+状态压缩DP)判断
- 【dp】codeforces C. Vladik and Memorable Trip
- Codeforces Round #390 (Div. 2) C. Vladik and chat （DP/记忆化搜索）
- 数学题（Vladik and fractions，743C）
- codeforces C. Vladik and Memorable Trip DP
- Codeforces Round #228 (Div. 2) B. Fox and Cross
- codeforces Anton and Fairy Tale
- 【Codeforces Round 354 (Div 2)A】【水题 贪心】Nicholas and Permutation 恰好交换一次的pos[n]-pos[1]
- Codeforces VK Cup 2012 Round 3 A. Variable, or There and Back Again(dfs)