Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21865 Accepted Submission(s): 10530
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.
Print the word "no" if not.
Sample Input
0 1 2 3 4 5
Sample Output
no no yes no no no
一开始 打表 发现 规律不明显 其实自己看到的规律是错误的 因为溢出了 所以以后打表要注意哦 别溢出了啊
规律是
no
no
yes
no
如此下去
垃圾的要命的水题
#include<stdio.h>
int main()
{
int i,n;
while(scanf("%d",&n)!=EOF)
{
n=n%4;
switch(n)
{
case 0: i=0;break;
case 1: i=0;break;
case 2: i=1;break;
case 3: i=0;break;
}
if(i)
printf("yes\n");
else printf("no\n");
}
return 0;
}