1021

 

 1 /*Problem Description
 2 There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
 3 
 4  
 5 
 6 Input
 7 Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).
 8 
 9  
10 
11 Output
12 Print the word "yes" if 3 divide evenly into F(n).
13 
14 Print the word "no" if not.
15 
16  
17 
18 Sample Input
19 0
20 1
21 2
22 3
23 4
24 5
25  
26 
27 Sample Output
28 no
29 no
30 yes
31 no
32 no
33 no
34 
35   
36     Description: to 
37  * 
38  * Author: Vincent
39  * 
40  * Date:2010/04/
41  * Contact:agilely@126.com 
42  * Zju CS Lab
43  */
44  //1021
45  #include<iostream>
46 #include<string>
47 #include <stdio.h>
48 int main()
49 {
50     int n;
51     while(scanf("%d",&n)==1)
52         puts(n%4==2?"yes":"no");
53 }
54

 

posted @ 2010-04-15 23:18  にんじゃ  阅读(142)  评论(0)    收藏  举报