C++蜜蜂的爬行路线_c++

// Author:PanDaoxi
#include <iostream>
using namespace std;
int main(){
	int start,end,a[1001]={0,1,2};
	cin>>start>>end;
	for(int i=3;i<=end-start;i++){
		a[i]=a[i-1]+a[i-2];
	}
	cout<<a[end-start]<<endl;
	return 0;
}