1.  C

/**
* ACM programming Contest WS 08/09
10183 - How Many Fibs?
* UVa Status: WA :(, 5 dec 2008
* Run Time: 0.000
* Programming Language: C
* @author Doina Logofatu logofatu@hm.edu
*/

#include<stdio.h>
#include<math.h>

void find_ij(long double *a, int size, long double aa, long double bb, int *i, int *j){
int k = 0;
while(a[k]<aa && k<size) k++;
*i = k;
while(a[k]<bb && k<size) k++;
*j = k-1;
}

int main(){

long double m, aa, bb;
long double a[482];
long double x0, x1, aux;
int i = 0, j;

m = pow(10, 100);

x0 = 1; a[i++]=1;
x1 = 2; a[i++]=2;

while (x1<m) {
aux = x0 + x1;
x0 = x1;
x1 = aux;
a[i++]=x1;
}

while (scanf("%lf%lf", &aa, &bb) == 2 && (aa || bb)){
if(bb==1) {printf("%d\n", 1); continue; }
find_ij(&a, 482, aa, bb, &i, &j);
printf("%d\n", (int)(j-i)+1);
}

return 0;
}