博客供考试复习，学习交流使用
超级楼梯：https://blog.csdn.net/nanfengzhiwoxin/article/details/81481316?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522158467259419724847041586%2522%252C%2522scm%2522%253A%252220140713.130056874…%2522%257D&request_id=158467259419724847041586&biz_id=0&utm_source=distribute.pc_search_result.none-task
不过我还是喜欢直接在数组里面定好前面几个数a[30]={0，1，2}，一个一个敲还是麻烦了一点。
一只小蜜蜂：https://blog.csdn.net/cr496352127/article/details/79712829
笔者稍微精简了一下

#include <stdio.h>
int main() {
	int a[51]={1,2};
	for(int i=3; i<51; i++) {
		a[i]=a[i-1]+a[i-2];
	}
	int n;
	scanf("%d\n",&n);
	while(n--) {
		int x,y;
		scanf("%d%d\n",&x,&y);
		printf("%d\n",a[y-x]);
	}
	return 0;
} 

C语言 骨牌铺方格

#include<stdio.h>
int main() {
	int i;
	int a[50]= {0,1,2};
	for(i=3; i<51; i++)
		a[i]=a[i-1]+a[i-2];
	while(scanf("%d",&i)!=EOF) {
		printf("%d\n",a[i]);   	
	}
}

Eddy’s 洗牌问题 https://blog.csdn.net/fastkeeper/article/details/43680439

#include<stdio.h>
int main() {
	int n;
	int a[21]= {0,1,2};
	for(n=2; n<21; n++) {
		a[n]=a[n-1]+a[n-2];
	}
	while(printf("sample input:\n")&&scanf("%d",&n)!=EOF) {
		printf("sample ooutput:\n%d\n",a[n]);
	}
	return 0;
}