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
0
1
2
3
4
5
Sample Output
no
no
yes
no
no
no
这道题应该是最简单的一道了吧,不用把每个答案都算出来,只要n是三的倍数,便输出yes,其它的就输出no就AC了。
下面是笔者代码:
#include<cstdio.h>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)==1)
{
if(n%4==2) printf("yes\n");
else printf("no\n");
}
return 0;
}