Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59435 Accepted Submission(s): 27785
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
#include <iostream>
#include <cstdio>
using namespace std;
int f[1000005];
int main()
{
f[0] = 1;
f[1] = 2;
int n;
for(int i = 2;i < 1000000;i++)
f[i] = (f[i-1]+f[i-2])%3;
while(cin>>n){
if(!f[n])cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
return 0;
}