Fibonacci Again

Fibonacci Again

Time Limit: 1000ms   Memory limit: 32768K  有疑问？点这里^_^

题目描述

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.

示例输入

012345

示例输出

nonoyesnonono

提示

hdoj1021 有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。

来源

Leojay

#include<stdio.h>int set(int n){int p;if(n==0)p=7;if(n==1)p=11;if(n>=2)p=set(n-1)+set(n-2);return p;}int main(){int n,m,a,b;while(scanf("%d",&n)!=EOF){m=set(n);if(m%3==0)printf("yes\n");elseprintf("no\n");}}