题目:
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
解析:
1. 分析题目,既然是mod 3所以很有可能是循环的
2. 于是进行打表(打表真的是个好东西),发现最后以为的数字具有变化周期,周期为12,打表结果如下图所示
#include
int main(){
int a[100]={7,11};
for(int i=2;i<12;i++)
{
a[i]=a[i-1]+a[i-2];
}
int n;
while(scanf("%d",&n)!=EOF)
{
if(a[n%12]%3!=0)
{
printf("no\n");
}
else
{
printf("yes\n");
}
}
return 0;
}