FIBVAL - VOI 2012 Bản vanxơ Fibonacci
Tác giả: skyvn97
Ngôn ngữ: C++
#include<cstdio>
const int res[]={0,1,1,2,3,5,1,6,0,6,6,5,4,2,6,1};
int fib(const int &x) {
return (res[(x+1)%16]);
}
int count(const int &u,const int &v) {
if (v-u+1>=32) return (((v-u+1)/16)*16);
int i;
for (i=u;i<v;i=i+1)
if (fib(i)==fib(i+1)) return (2);
return (-1);
}
int c,u,v,t;
int main(void) {
scanf("%d",&t);
for (c=1;c<=t;c=c+1) {
scanf("%d",&u);
scanf("%d",&v);
printf("%d\n",count(u,v));
}
return 0;
}