Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36379 Accepted Submission(s): 17573
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题目大意 :如果f[n]能够整除”3“则输出yes 否则no解题思路 :根据多组f[n]对3取余找出规律n%2==0的都可以满足;附代码 :#include <stdio.h> int main() { int n; while(scanf("%d",&n)!=EOF){ if(n%4==2) printf("yes\n"); else printf("no\n"); } return 0; }