思路:观察一下可以知道,比如走到7,首先要走到5或者6,要走到5,首先要先走到4或3...递推一下即可
#include<iostream>
#include<cstdio>
using namespace std;
#define LL long long
LL f[60];
int n;
int main()
{
int T;
scanf("%d",&T);
f[0]=1;
f[1]=1;
for (int i = 2;i<51;i++)
f[i]=f[i-1]+f[i-2];
while (T--)
{
int a,b;
scanf("%d%d",&a,&b);
printf("%lld\n",f[b-a]);
}
}