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.
#include <cstdio>
int main()
{
int n;
while (~scanf("%d", &n))
{
if (n == 0 || n == 1)
{
printf("no\n");
continue;
}
if (n == 2)
{
printf("yes\n");
continue;
}
if (n % 4 == 2) printf("yes\n");
else printf("no\n");
}
return 0;
}
Sample Input
0 1 2 3 4 5
Sample Output
no no yes no no no