Fib数之奇偶性
#include<stdio.h>
#include <stdlib.h>
#include <time.h>
int fibonacci(int n)
{ if(n <= 2)
return 1;
int n1 = 1, n2 = 1, sn = 0;
for(int i = 0; i < n - 2; i ++)
{sn = n1 + n2;
n1 = n2;
n2 = sn; }
return sn;
}
int main(){
int N[10000],M,i,j=0;
printf("请输入N (1≤N≤10000)\n");
for(i=0;i<10000;i++){
scanf("%d",&N[i]);
j++;
if(N[i]==0)break;
}
for(i=j;i>1;i--){
M=fibonacci(N[i]);
if(M%2==0)printf("EVEN\n");
else printf("ODD\n");
}
}