Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36028 Accepted Submission(s): 17385
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
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
if(n==2) cout<<"yes\n";
else if((n-2)%4==0) cout<<"yes\n";
else cout<<"no\n";
}
return 0;
}
HUDJ 1021 Fibonacci Again
原文：http://blog.csdn.net/hyccfy/article/details/37966099
