hdoj 1021 Fibonacci Again-CSDN博客

本文链接：https://blog.csdn.net/SimonCoder/article/details/38107299

中国剩余定理

(A*B)%C=((A%C)*(B%C))%C

(A+B)%C=(A%C+B%C)%C

(A-B)%C=(A%C-B%C)%C

http://acm.hdu.edu.cn/showproblem.php?pid=1021

Fibonacci Again

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

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

Sample Output

  
  
   
   no
no
yes
no
no
no
  
  
  
  
   
    
  
  
  
  
   
   #include<stdio.h>
int a[1000010];
//int F_Y(int n)//用函数不行，会溢出栈，而且不溢出栈也会超时 
//{
//    int i,j,k;
//    if(n==0)
//    return 1;
//    else if(n==1)
//    return 2;
//    else
//    return (F_Y(n-1)%3+F_Y(n-2)%3)%3; 
//
//}  
int main()
{
    int i;
    for(i=2,a[0]=1,a[1]=2;i<1000010;i++)
    a[i]=(a[i-1]%3+a[i-2]%3)%3;
    //for(i=0;i<200;i++)
    //printf("%d#\n",a[i]);
    int n;
    while(scanf("%d",&n)!=EOF)
    {
          if(a[n]==0)//可以除尽 
          printf("yes\n");
          else
          printf("no\n");//除不尽 
    }
    return 0;
}