Guest
Login
Home Page
Problems
Status
Contests
Ranklist
F.A.Qs
Fib数之奇偶性
Time Limit:1000MS Memory Limit:32768K
Description:
Fibonacci数列定义如下: a[1]=1; a[2]=1; a[n]=a[n-1]+a[n-2](n>2)。 对于给定N (1≤N≤10000),请判别数列第N项的奇偶性。
Input:
给定整数N,如N=0则结束输入(N=0不需要判断)。
Output:
输出第N项Fibonacci数列的奇偶性,如果为奇数则请输出“ODD”,否则为“EVEN”。
Sample Input:
1 2 3 0
Sample Output:
ODD ODD EVEN
Status
Submit
Zhe Jiang University Of Technology Online Programming Space Beta1.3
Designed & Developped By
Jin Qiwei
.
Refactored By cb@zjut.edu.cn , QQ Group: 723311416 All Copyright Reserved 2006-
818