Ŀ

գҪıйص䡣
һrepeat (0<repeat<10)repeat㣺
 m  n(1<=m,n<=10000) m  n ֮еFibonacci
Fibonacci (һ)1  1  2  3  5  8  13  21 ......
Ҫ岢úfib(n)ĹǷص n Fibonacciβnintlong磬fib(7)ķֵ13
ʹ䣺printf("%ld ", f);
ʾ˵
룺
3               (repeat=3)
1 10            (m=1, n=10)
20 100          (m=20, n=100)
1000 6000       (m=1000, n=6000)

1 1 2 3 5 8        (110֮Fibonacci)
21  34  55  89     (20100֮Fibonacci)
1597  2584  4181   (10006000֮Fibonacci)



#include "stdio.h"
#include "math.h"
int main(void)
{
   int i, m, n;
   int repeat, ri;
   long f;
   long fib(int n);

   scanf("%d",&repeat);
   for(ri = 1; ri <= repeat; ri++){
        scanf("%d%d", &m, &n);
/*---------*/
        printf("\n");
    }
}

/*---------*/
