每日一题4.9.2

每日一题4.9.2

客似云来

解题思路： 典型的斐波那契数列问题
代码实现：

#define _CRT_SECURE_NO_WARNINGS 1

#include <iostream>
#include <stdio.h>
#include <cstdio>
using namespace std;
int main()
{
	long long data[81];
	long long sum[81];
	data[1] = data[2] = 1;
	sum[1] = 1;
	sum[2] = 2;
	for (int i = 3; i <= 80; ++i)
	{
		data[i] = data[i - 1] + data[i - 2];
		sum[i] = sum[i - 1] + data[i];
	}
	int f, t;
	while (scanf("%d %d",&f,&t)!= EOF)
	{
		cout << sum[t] - sum[f] + data[f] << endl;
	}
	return 0;
}