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
0
1
2
3
4
5
Sample Output
no
no
yes
no
no
no
fibonacci一般判断yes,no的时候要注意一下是否可以找规律就行。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int a[8];
a[0] = 1;
a[1] = 2;
a[2] = 0;
a[3] = 2;
a[4] = 2;
a[5] = 1;
a[6] = 0;
a[7] = 1;
int n;
while(cin>>n)
{
if(a[n%8]==0)
printf("yes\n");
else
printf("no\n");
}
}