首页 > 编程语言 > 详细

acm hdu p1021 Fibonacci Again java解答 水水 找规律

时间:2015-08-29 09:52:07      阅读:206      评论:0      收藏:0      [点我收藏+]

Fibonacci Again

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


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


根据前辈们找的规律   8*k+2或8*k+6   k为自然数


package HDU;
import java.util.Scanner;
public class p1021 {
 public static void main(String[] args) {
     Scanner sc=new Scanner(System.in);
      while(sc.hasNext()){
    	  int n=sc.nextInt();
    	  if(n%8==2||n%8==6){
    		  System.out.println("yes");
    	  }else{
    		 System.out.println("no"); 
    	  }
      }
     
    }

}





acm hdu p1021 Fibonacci Again java解答 水水 找规律

原文:http://blog.csdn.net/xianzgiyou/article/details/48065423

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!