题目描述
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2)
输入
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000)
输出
Print the word "yes" if 3 divide evenly into F(n).
Print the word "no" if not.
样例输入
0
1
2
3
4
5
样例输出
no
no
yes
no
no
no
参考代码
#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n>=100) n=n%100;
if(n%4==2) printf("yesn");
else printf("non");
}
return 0;
}
解析
暂无
