codeforces 743 C. Vladik and fractions (数学)

最新推荐文章于 2021-09-19 10:34:31 发布

原创最新推荐文章于 2021-09-19 10:34:31 发布 · 493 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

数学同时被 2 个专栏收录

67 篇文章

订阅专栏

散记

24 篇文章

订阅专栏

Vladik和Chloe比拼数学能力，Vladik声称能将分数2/n表示为三个不同正分数的和。题目要求找到不超过10^9的三个正整数x, y, z，满足2/n = 1/x + 1/y + 1/z，且x, y, z互不相同。如果存在这样的解，输出解；否则输出-1。给定1 ≤ n ≤ 10^4，存在多种可能答案，需要输出任意一组符合条件的x, y, z。" 113613446,10293363,MyBatis3 SQL映射文件详解,"['MyBatis', 'SQL映射', '数据库操作', 'Java开发']

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 $\text{[math]}$ as a sum of three distinct positive fractions in form $\text{[math]}$ .

Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that $\text{[math]}$ . 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

想到了就是水题，想不到那就没法了。

数学知识：2/n = 1/n + 1/n = 1/n + 1/(n+1) + 1/[n*(n+1)]

code :

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
    int n;
    scanf("%d",&n);
    if(n==1)
        printf("-1\n");
    else
        printf("%d %d %d\n",n,n+1,n*(n+1));
    return 0;
}