zoukankan      html  css  js  c++  java
  • <cf>Hexadecimal's theorem

    A. Hexadecimal's theorem
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Recently, a chaotic virus Hexadecimal advanced a new theorem which will shake the Universe. She thinks that each Fibonacci number can be represented as sum of three not necessary different Fibonacci numbers.

    Let's remember how Fibonacci numbers can be calculated. F0 = 0F1 = 1, and all the next numbers areFi = Fi - 2 + Fi - 1.

    So, Fibonacci numbers make a sequence of numbers: 011235813, ...

    If you haven't run away from the PC in fear, you have to help the virus. Your task is to divide given Fibonacci number n by three not necessary different Fibonacci numbers or say that it is impossible.

    Input

    The input contains of a single integer n (0 ≤ n < 109) — the number that should be represented by the rules described above. It is guaranteed that n is a Fibonacci number.

    Output

    Output three required numbers: ab and c. If there is no answer for the test you have to print "I'm too stupid to solve this problem" without the quotes.

    If there are multiple answers, print any of them.

    Sample test(s)
    input
    3
    
    output
    1 1 1
    
    input
    13
    
    output
    2 3 8
    

    关于这题。。。无语了。。。

    AC Code

    #include <iostream>
    using namespace std;
    
    int main()
    {   
        int n;
        while(cin>>n) cout<<"0 0 "<<n<<endl;
        return 0;
    }
    

    以上的代码已经AC。。。因为0就是斐波拉契数列中的元素

  • 相关阅读:
    云之家技术文档下载
    原始MAC地址
    如何创建数据中心
    获取金蝶云试用许可
    【分享】工作流支持邮件提醒相关配置
    调试K3网页版需要注意的问题
    excel2010冻结行列
    Delphi 泛型 接口约束的实例 转
    delphi 各新版本特性收集
    Delphi XE Refactor重构功能简单说明 转
  • 原文地址:https://www.cnblogs.com/cszlg/p/2910493.html
Copyright © 2011-2022 走看看