编程啦-Problem-1268

gistfile1.c

/* Bianchengla - Problem 1268. */
#include <stdio.h>

int count(int distance);
int count_val[40] = {0};

int main()
{
	int N = 0;
	int start = 0, end = 0;
	
	scanf("%d\n", &N);
	while(N--)
	{
		scanf("%d %d", &start, &end);
		printf("%d\n", count(end-start));
	}
	
	return 0;
}

int count(int distance)
{
	if(distance <= 2)
		return distance;
	if( 0 == count_val[distance] )
		count_val[distance] = count(distance-1) + count(distance-2);
	return count_val[distance];
}