一只小蜜蜂...
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 87158 Accepted Submission(s): 31143
Problem Description
有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房,不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。
其中,蜂房的结构如下所示。
Input
输入数据的第一行是一个整数N,表示测试实例的个数,然后是N 行数据,每行包含两个整数a和b(0<a<b<50)。
Output
对于每个测试实例,请输出蜜蜂从蜂房a爬到蜂房b的可能路线数,每个实例的输出占一行。
Sample Input
2 1 2 3 6
Sample Output
1 3
Author
lcy
Source
Recommend
lcy | We have carefully selected several similar problems for you: 2045 2046 2047 2049 2048
import java.util.Scanner;
public class Main
{
public static void main(String []args)
{
Scanner in =new Scanner(System.in);
long[] a = new long[60];
a[1]=1;
a[2]=2;
for (int i = 3; i < 55; i++)
{
a[i] = a[i - 1] + a[i - 2];
}
int n = in.nextInt();
while (n-- > 0)
{
int s = in.nextInt();
int e = in.nextInt();
System.out.println(a[e - s]);
}
}
}