zoukankan      html  css  js  c++  java
  • Codeforces Round #384 (Div. 2) C. Vladik and fractions

    传送门:http://codeforces.com/contest/743/problem/C

    C. Vladik and fractions
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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  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 xy 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 xy and z (1 ≤ x, y, z ≤ 109, x ≠ yx ≠ zy ≠ 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 }
    自己选的路,跪着也要把它走完------ACM坑
  • 相关阅读:
    ThreadPoolExecutor
    HashMap
    ReentrantReadWriteLock
    AbstractQueuedSynchronizer
    KAFKA:如何做到1秒发布百万级条消息
    Kafka生产者性能优化之吞吐量VS延迟
    Hadoop YARN:调度性能优化实践(转)
    Windows下安装MySQL压缩zip包
    Android 8 蓝牙打开过程
    msm audio platform 驱动代码跟踪
  • 原文地址:https://www.cnblogs.com/IKnowYou0/p/6183259.html
Copyright © 2011-2022 走看看