A little bee (hangdian 2044)

/* A little bee
Problem description
A trained bee can only crawl to the adjacent beehive on the right, and cannot reverse crawl. Calculate the number of possible routes for bees to climb from Master A to Master B.
The structure of the beehive is as follows.

 

Input
The first row of the input data is an integer N, indicating the number of test instances, followed by N rows of data. Each row contains two integers A and B (0 <A <B <50 ).

 

Output
For each test instance, output the number of possible routes for the bee to climb from the master a to the Master B. The output of each instance occupies one line.

 

Sample Input
2
1 2
3 6
 

Sample output
1
3

*/# Include <cstdio>
_ Int64 s [100] = };
Int main ()
{
Int test;
Scanf ("% d", & test );
While (test --)
{
Int I, A, B, J, sum = 0;
Scanf ("% d", & A, & B );
For (I = 3; I <50; I ++)
{
S [I] = s [I-1] + s [I-2];
}
Printf ("% i64d \ n", s [B-A]);
}
// While (1 );
Return 0;

}