codeforces round #384 div2 C Vladik and fractions(构造)

链接:https://codeforces.com/contest/743/problem/C

给一个n,构造一组数(x,y,z),使得2/n=(1/x)+(1/y)+(1/z);

显然n,(n+1),n(n+1)这组数可以,但当n=1是无法构造;

代码:

#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;

int main()
{
    int n;
    cin>>n;
    if(n==1)
        cout<<"-1\n";
    else
        printf("%d %d %d\n",n,n+1,n*(n+1));
    return 0;
}

猜你喜欢

转载自www.cnblogs.com/sweetlittlebaby/p/12679414.html
今日推荐