Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25462 Accepted Submission(s): 12331
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
Author
Leojay
Recommend
JGShining
半天没读懂题。。。囧
7.11.18……这个斐波拉契数列,求第n个数是否能被3整除。 找规律
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n;
while (cin>>n)
if(n%4==2) cout<<"yes\n";
else cout<<"no\n";
return 0;
}