Welcome   HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online
Home
FAQs
Problem Set
Practices
Online Contests
Major Exercises
OI Special
Judgement
Submit
Online Status
User Ranklist
Users
Register new
Login
Web Links
Hunan Normal University
College of Information Science and Engineering
另类的斐波拉契问题
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB
Total submit users: 64, Accepted users: 55
Problem 11301 : No special judgement
Problem description
  众所周知,斐波拉契序列有以下特性:
F[n] = F[n - 1]  + F[n - 2] ( n >= 2);
     现在,我们令F[0] = 5, F[1] = 13。
     现在我们需判断F[n]是否能够被3整除。

Input
  每行输入一个数n( 0 < n < 1,000,000,000 )。

Output
  每个n对应输出一行,如果F[n]能被3整除,则输出"Yes",否则则输出"No"。

Sample Input
0
1
2
6
Sample Output
No
No
Yes
Yes
Problem Source
  HUNNU Contest 

Submit   Discuss   Judge Status  Problems  Ranklist 

HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online, Version 2010.5.5.final.
Web visits:18405 today,16241396 total, since 2010-05-07