#include<bits/stdc++.h>
using namespace std;
int main()
{int n;cin>>n;if(n==1)cout<<-1<<endl;elsecout<<n<<' '<<n+1<<' '<<n*(n+1)<<endl;return 0;
}
详细解决方案
743C. Vladik and fractions codeforces
热度:15 发布时间:2024-01-10 18:45:45.0
相关解决方案
- Codeforces Round #166 (Div. 二) D - Good Substrings
- Codeforces Round #165 (Div. 二)(完全)
- Codeforces Round #166 (Div. 二)
- Codeforces Round #167 (Div. 二 && Div.1)
- Codeforces Round #282 (Div. 二)-A. Digital Counter
- Codeforces Round #248 (Div. 一)——Nanami's Digital Board
- Codeforces 10C Digital Root 法令题
- Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) 例题
- codeforces 492D Vanya and Computer Game(额。数学题?水题吧)
- codeforces #199 C. Cupboard and Balloons 例题
- Codeforces Round #199 (Div. 二) C. Cupboard and Balloons
- Codeforces Round #199 (Div. 二) C. Cupboard and Balloons
- Educational Codeforces Round 77 C. Infinite Fence
- codeforces 1272B Snow Walking Robot
- POJ 1131 Octal Fractions 高精度小数+JAVA .
- Codeforces Round #380 C. Road to Cinema .
- codeforces 55d A.Beautiful numbers 数位DP -
- 【图论】Codeforces Manthan Codefest18E Trips
- 【构造】Codeforces 1025E Colored Cubes
- 【图论】Codeforces 1019C Sergey's problem
- 【交互题】Codeforces 1019B The hat
- 【枚举】COdeforces 1019A Elections
- 【乱搞】Codeforces EDU37 Connected Components
- 【DP】Codeforces EDU37 Tanks
- Codeforces 456 Div2
- Codeforces Round #411 (Div. 2) 题解
- codeforces 789 div2 题解
- codeforces 721B B. Passwords -- by lethalboyd
- UVa - 10976 - Fractions Again?!(暴力求解枚举)
- Fractions Again?! UVA - 10976