zoukankan      html  css  js  c++  java
  • Fibonacci Again

     

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 43312    Accepted Submission(s): 20674


    Problem Description
    There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
     

    Input
    Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).
     

    Output
    Print the word "yes" if 3 divide evenly into F(n).

    Print the word "no" if not.
     

    Sample Input
    0 1 2 3 4 5
     

    Sample Output
    no no yes no no no
     


     

     

     

    #include<stdio.h>
    main()
    {
     int a,b,i,j;
     while(scanf("%d",&a)!=EOF)
     {
      if((a-2)%4==0)
      printf("yes ");
      else printf("no ");
     }
     return 0;
    }

  • 相关阅读:
    Java程序员从笨鸟到菜鸟全部博客目录
    Problem I
    Problem I
    Problem S
    Problem S
    Problem X
    Problem X
    Problem Q
    Problem Q
    Ellipse
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/5367248.html
Copyright © 2011-2022 走看看